LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

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

Photo from wikipedia

We use the finite dimensional monotonicity methods in order to investigate problems connected with the discrete sx,·-Laplacian on simple, connected, undirected, weighted, and finite graphs with nonlinearities given in a… Click to show full abstract

We use the finite dimensional monotonicity methods in order to investigate problems connected with the discrete sx,·-Laplacian on simple, connected, undirected, weighted, and finite graphs with nonlinearities given in a non-potential form. Positive solutions are also considered.

Keywords: weighted finite; finite graphs; connected undirected; discrete laplacian; undirected weighted; simple connected

Journal Title: Entropy
Year Published: 2022

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.