Results 11 to 20 of about 310,108 (288)
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
Detecting degree symmetries in networks [PDF]
, 2006 The surrounding of a vertex in a network can be more or less symmetric. We derive measures of a specific kind of symmetry of a vertex which we call degree symmetry -- the property that many paths going out from a vertex have overlapping degree sequences.
Petter Holme +4 more
core +2 more sources
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
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
Study on Bipolar Single-Valued Neutrosophic Graphs With Novel Application [PDF]
Neutrosophic Sets and Systems, 2020 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
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
On a preferential attachment and generalized P\'{o}lya's urn model [PDF]
, 2013 We study a general preferential attachment and Polya's urn model. At each step a new vertex is introduced, which can be connected to at most one existing vertex. If it is disconnected, it becomes a pioneer vertex.
Collevecchio, Andrea +2 more
core +3 more sources
The vertex connectivity of a {0, 2}-graph equals its degree
Discrete Mathematics, 1997 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]
Lithuanian Mathematical Journal, 2020 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