Existence and multiplicity results for boundary value problems connected with the discrete p(.)-Laplacian on weighted finite graphs
classification
🧮 math.CA
keywords
discretefinitegraphslaplacianboundaryconnectedexistencemultiplicity
read the original abstract
We use the direct variational method, the Ekeland variational principle, the mountain pass geometry and Karush-Kuhn-Tucker theorem in order to investigate existence and multiplicity results for boundary value problems connected with the discrete p(.)-Laplacian on weighted finite graphs. Several auxiliary inequalities for the discrete p(.)-Laplacian on finite graphs are also derived. Positive solutions are considered.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.