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...

全面介绍

书目详细资料

Principais autores:	Filip Pietrusiak, Renata Wieteska, Przemysław Gordinowicz
格式:	Artigo
语言:	Inglês
出版:	MDPI AG 2022-09-01
丛编:	Entropy
主题:	simple graph connected graph undirected graph weighted graph finite graph <i>s</i>(<i>x</i>,·)-Laplacian on a graph
在线阅读:	https://www.mdpi.com/1099-4300/24/10/1353
标签:	添加标签 没有标签, 成为第一个标记此记录!