Results 21 to 30 of about 310,108 (288)
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
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
A straightforward edge centrality concept derived from generalizing degree and strength
Scientific Reports, 2022 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
Austrian Journal of Statistics, 2017 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
On the extremal connective eccentricity index among trees with maximum degree [PDF]
Transactions on Combinatorics, 2021 The connective eccentricity index (CEI) of a graph $G$ is defined as $\xi^{ce}(G)=\sum_{v \in V(G)}\frac{d_G(v)}{\varepsilon_G(v)}$, where $d_G(v)$ is the degree of $v$ and $\varepsilon_G(v)$ is the eccentricity of $v$. In this paper, we characterize the
Fazal Hayat
doaj +1 more source
On the degrees of a strongly vertex-magic graph
Discrete Mathematics, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Balbuena, C. +8 more
openaire +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
Degree subtraction eigenvalues and energy of graphs [PDF]
Computer Science Journal of Moldova, 2018 The degree subtraction matrix $DS(G)$ of a graph $G$ is introduced, whose $(j,k)$-th entry is $d_G(v_j) - d_G(v_k)$, where $d_G(v_j)$ is the degree of a vertex $v_j$ in $G$.
H. S. Ramane +3 more
doaj
Faster exponential-time algorithms in graphs of bounded average degree [PDF]
, 2013 We first show that the Traveling Salesman Problem in an n-vertex graph with average degree bounded by d can be solved in O*(2^{(1-\eps_d)n}) time and exponential space for a constant \eps_d depending only on d, where the O*-notation suppresses factors ...
A. Björklund +6 more
core +2 more sources
Computing the degree of some matchings in a graph
The American Journal of CombinatoricsLet \(G\) be a connected graph. A matching \(M\) in \(G\) is a set of edges of \(G\) without two of them adjacent (having a common vertex). The graph whose vertices are the matchings in \(G\) and two matchings \(M\) and \(N\) are adjacent if and only if
Rosário Fernandes
doaj +1 more source