On the Solvability of the Discrete <i>s</i>(<i>x</i>,·)-Laplacian Problems on Simple, Connected, Undirected, Weighted, and Finite Graphs

We use the finite dimensional monotonicity methods in order to investigate problems connected with the discrete <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>s</mi><mfenced separators="" open="(" close=")"><mi>x</mi><mo>,</mo><mo>·</mo></mfenc...

Ausführliche Beschreibung

Bibliografische Detailangaben

Hauptverfasser:	Filip Pietrusiak, Renata Wieteska, Przemysław Gordinowicz
Format:	Artigo
Sprache:	Inglês
Veröffentlicht:	MDPI AG 2022-09-01
Schriftenreihe:	Entropy
Schlagworte:	simple graph connected graph undirected graph weighted graph finite graph <i>s</i>(<i>x</i>,·)-Laplacian on a graph
Online-Zugang:	https://www.mdpi.com/1099-4300/24/10/1353
Tags:	Tag hinzufügen Keine Tags, Fügen Sie das erste Tag hinzu!