On the Solvability of the Discrete s(x,·)-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 [Formula: see text]-Laplacian on simple, connected, undirected, weighted, and finite graphs with nonlinearities given in a non-potential form. Positive solutions are also considered.

Detalles Bibliográficos
Autores principales: Pietrusiak, Filip, Wieteska, Renata, Gordinowicz, Przemysław
Formato: Online Artículo Texto
Lenguaje:English
Publicado: MDPI 2022
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9601339/
https://www.ncbi.nlm.nih.gov/pubmed/37420372
http://dx.doi.org/10.3390/e24101353
_version_ 1784817039774318592
author Pietrusiak, Filip
Wieteska, Renata
Gordinowicz, Przemysław
author_facet Pietrusiak, Filip
Wieteska, Renata
Gordinowicz, Przemysław
author_sort Pietrusiak, Filip
collection PubMed
description We use the finite dimensional monotonicity methods in order to investigate problems connected with the discrete [Formula: see text]-Laplacian on simple, connected, undirected, weighted, and finite graphs with nonlinearities given in a non-potential form. Positive solutions are also considered.
format Online
Article
Text
id pubmed-9601339
institution National Center for Biotechnology Information
language English
publishDate 2022
publisher MDPI
record_format MEDLINE/PubMed
spelling pubmed-96013392022-10-27 On the Solvability of the Discrete s(x,·)-Laplacian Problems on Simple, Connected, Undirected, Weighted, and Finite Graphs Pietrusiak, Filip Wieteska, Renata Gordinowicz, Przemysław Entropy (Basel) Article We use the finite dimensional monotonicity methods in order to investigate problems connected with the discrete [Formula: see text]-Laplacian on simple, connected, undirected, weighted, and finite graphs with nonlinearities given in a non-potential form. Positive solutions are also considered. MDPI 2022-09-24 /pmc/articles/PMC9601339/ /pubmed/37420372 http://dx.doi.org/10.3390/e24101353 Text en © 2022 by the authors. https://creativecommons.org/licenses/by/4.0/Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).
spellingShingle Article
Pietrusiak, Filip
Wieteska, Renata
Gordinowicz, Przemysław
On the Solvability of the Discrete s(x,·)-Laplacian Problems on Simple, Connected, Undirected, Weighted, and Finite Graphs
title On the Solvability of the Discrete s(x,·)-Laplacian Problems on Simple, Connected, Undirected, Weighted, and Finite Graphs
title_full On the Solvability of the Discrete s(x,·)-Laplacian Problems on Simple, Connected, Undirected, Weighted, and Finite Graphs
title_fullStr On the Solvability of the Discrete s(x,·)-Laplacian Problems on Simple, Connected, Undirected, Weighted, and Finite Graphs
title_full_unstemmed On the Solvability of the Discrete s(x,·)-Laplacian Problems on Simple, Connected, Undirected, Weighted, and Finite Graphs
title_short On the Solvability of the Discrete s(x,·)-Laplacian Problems on Simple, Connected, Undirected, Weighted, and Finite Graphs
title_sort on the solvability of the discrete s(x,·)-laplacian problems on simple, connected, undirected, weighted, and finite graphs
topic Article
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9601339/
https://www.ncbi.nlm.nih.gov/pubmed/37420372
http://dx.doi.org/10.3390/e24101353
work_keys_str_mv AT pietrusiakfilip onthesolvabilityofthediscretesxlaplacianproblemsonsimpleconnectedundirectedweightedandfinitegraphs
AT wieteskarenata onthesolvabilityofthediscretesxlaplacianproblemsonsimpleconnectedundirectedweightedandfinitegraphs
AT gordinowiczprzemysław onthesolvabilityofthediscretesxlaplacianproblemsonsimpleconnectedundirectedweightedandfinitegraphs

Ejemplares similares