Cargando…
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.
| Autores principales: | , , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
MDPI
2022
|
| Materias: | |
| 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 |