Results 1 to 10 of about 196,583,728 (297)
Relating graph energy with vertex-degree-based energies [PDF]
Vojnotehnički Glasnik, 2020 Introduction/purpose: The paper presents numerous vertex-degree-based graph invariants considered in the literature. A matrix can be associated to each of these invariants.
Ivan Gutman
doaj +1 more source
Stability of Complement Degree Polynomial of Graphs
مجلة بغداد للعلوم, 2023 A graph is a structure amounting to a set of objects in which some pairs of the objects are in some sense related. The objects correspond to mathematical abstractions called vertices (also called nodes or points) and each of the related pairs of ...
Safeera K, Anil Kumar V
doaj +1 more source
On single-valued co-neutrosophic graphs [PDF]
Neutrosophic Sets and Systems, 2018 In this paper, we introduce the notion of a single-valued co-neutrosophic graphs and study some methods of construction of new single-valued co-neutrosophic graphs.
R. Dhavaseelan +3 more
doaj +1 more source
PREFERENTIAL ATTACHMENT WITH FITNESS DEPENDENT CHOICE
Физико-химические аспекты изучения кластеров, наноструктур и наноматериалов, 2021 We study the asymptotic behavior of the maximum degree in the preferential attachment tree model with a choice based on both the degree and fitness of a vertex.
Y.A. Malyshkin
doaj +1 more source
Cost-based analyses of random neighbor and derived sampling methods
Applied Network Science, 2022 Random neighbor sampling, or RN, is a method for sampling vertices with a mean degree greater than that of the graph. Instead of naïvely sampling a vertex from a graph and retaining it (‘random vertex’ or RV), a neighbor of the vertex is selected instead.
Yitzchak Novick, Amotz Bar-Noy
doaj +1 more source
Some studies on products of Fuzzy soft graphs
Ratio Mathematica, 2021 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
Sufficient Conditions for Graphs to Be k-Connected, Maximally Connected, and Super-Connected
Complexity, 2021 Let G be a connected graph with minimum degree δG and vertex-connectivity κG. The graph G is k-connected if κG≥k, maximally connected if κG=δG, and super-connected if every minimum vertex-cut isolates a vertex of minimum degree. In this paper, we present
Zhen-Mu Hong +3 more
doaj +1 more source
Chemical applicability of Sombor indices [PDF]
Journal of the Serbian Chemical Society, 2021 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
On Euler-Sombor index of benzenoids and phenylenes [PDF]
Kragujevac Journal of ScienceThe 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
Conjecture Involving Arithmetic-Geometric and Geometric-Arithmetic Indices
Discrete Dynamics in Nature and Society, 2022 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