Results 11 to 20 of about 42,000 (265)
Chemical applicability of Sombor indices [PDF]
Recently, a novel class of degree-based topological molecular descriptors was proposed, the so-called Sombor indices. Within this study, the predictive and discriminative potentials of the Sombor index, the reduced Sombor index, and the average Sombor ...
Redžepović Izudin
doaj +1 more source
Some studies on products of Fuzzy soft graphs
In this paper, alpha, beta and gamma product of two fuzzy soft graphs are defined. The degree of a vertex in these product fuzzy soft graphs are determined and its regular properties are studied.
S Shashikala, Anil P Narappanavar
doaj +1 more source
Conjecture Involving Arithmetic-Geometric and Geometric-Arithmetic Indices
The geometric-arithmetic (GA) index of a graph G is the sum of the ratios of geometric and arithmetic means of end-vertex degrees of edges of G. Similarly, the arithmetic-geometric (AG) index of G is defined. Recently, Vujošević et al. conjectured that a
Zainab Alsheekhhussain +3 more
doaj +1 more source
Study on Bipolar Single-Valued Neutrosophic Graphs With Novel Application [PDF]
Unipolar is less fundamental than bipolar cognition based on truth, and composure is a restraint for truth-based worlds. Bipolarity is the most powerful phenomenon that survives when truth disappeared in a black hole due to Hawking radiation or ...
M. Aslam Malik +5 more
doaj +1 more source
The vertex connectivity of a {0, 2}-graph equals its degree
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Brouwer, A.E., Mulder, H.M.
openaire +4 more sources
A Note on the Vertex Degree Distribution of Random Intersection Graphs [PDF]
We establish the asymptotic degree distribution of the typical vertex of inhomogeneous and passive random intersection graphs under the minimal moment conditions.
openaire +2 more sources
On Euler-Sombor index of benzenoids and phenylenes [PDF]
The Euler-Sombor index of a graph, EU(G), is a recently introduced vertex-degree based topological index. It is derived from the geometric consideration of a graph.
Redžepović Izudin, Muminović Lejla
doaj +1 more source
On the complexity of making a distinguished vertex minimum or maximum degree by vertex deletion
16 pages, 4 figures, submitted to Elsevier's Journal of Discrete ...
Sounaka Mishra +2 more
openaire +2 more sources
A straightforward edge centrality concept derived from generalizing degree and strength
Vertex degree—the number of edges that are incident to a vertex—is a fundamental concept in network theory. It is the historically first and conceptually simplest centrality concept to rate the importance of a vertex for a network’s structure and ...
Timo Bröhl, Klaus Lehnertz
doaj +1 more source
Random Graphs' Robustness in Random Environment
We consider configuration graphs the vertex degrees of which are independent and follow the power-law distribution. Random graphs dynamics takes place in a random environment with the parameter of vertex degree distribution following uniform ...
Marina Leri, Yury Pavlov
doaj +1 more source

