On the Solvability of the Discrete s(x,·)-Laplacian Problems on Simple, Connected, Undirected, Weighted, and Finite Graphs
Sign Up to like & getrecommendations! Published in 2022 at "Entropy"
DOI: 10.3390/e24101353
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… read more here.
Keywords: weighted finite; finite graphs; connected undirected; discrete laplacian ... See more keywords
A Generalization of the Importance of Vertices for an Undirected Weighted Graph
Sign Up to like & getrecommendations! Published in 2021 at "Symmetry"
DOI: 10.3390/sym13050902
Abstract: Establishing a node importance ranking is a problem that has attracted the attention of many researchers in recent decades. For unweighted networks where the edges do not have any attached weight, many proposals have been… read more here.
Keywords: weighted graph; undirected weighted; importance; generalization importance ... See more keywords