Results 21 to 30 of about 310,485 (285)
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
Reformulated Zagreb Indices of Some Derived Graphs
Mathematics, 2019 A topological index is a numeric quantity that is closely related to the chemical constitution to establish the correlation of its chemical structure with chemical reactivity or physical properties.
Jia-Bao Liu +4 more
doaj +1 more source
Usefulness of Combinations of Vertex-Degree Weighted Path Indices and Elements of a Universal Matrix
Acta Chimica Slovenica, 2019 The mutually optimized combinations of vertex-degree weighted path indices and the vertex-degree vertex-distance weighted elements of the Universal matrix were applied in the way of TInew = ∑kN×PN(aN,bN,...) + kij×uij(aij,bij,cij).
Anton Perdih
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
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
On Certain Types of Neutrosophic Fuzzy Graphs
Pan-American Journal of Mathematics, 2022 In this paper, we introduce some types of NF graphs and operations. Also we define the partial NF subgraph, spanning NF subgraph, strong degree of the vertex, total strong degree of the vertex and its properties are included.
Alias B. Khalaf, Prithivirajan Padma
doaj +1 more source
Bose-Einstein condensation in random directed networks [PDF]
, 2003 We consider the phenomenon of Bose-Einstein condensation in a random growing directed net- work. The network grows by the addition of vertices and edges. At each time step the network gains a vertex with probabilty p and an edge with probability 1 − p.
Rodgers, GJ, Sotolongo-Costa, O
core +2 more sources
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
Proximity Drawings of High-Degree Trees [PDF]
, 2010 A drawing of a given (abstract) tree that is a minimum spanning tree of the vertex set is considered aesthetically pleasing. However, such a drawing can only exist if the tree has maximum degree at most 6. What can be said for trees of higher degree?
Barát J. +5 more
core +1 more source
A Golden Ratio Inequality for Vertex Degrees of Graphs [PDF]
The American Mathematical Monthly, 2019 Motivated by the study of the crossing number of graphs, it is shown that, for trees, the sum of the products of the degrees of the end-vertices of all edges has an upper bound in terms of the sum of all vertex degrees to the power of $ ^2$, where $ $ is the golden ratio. The exponent $ ^2$ is best possible.
Fiachra Knox, Bojan Mohar, David R. Wood
openaire +2 more sources