Results 21 to 30 of about 309,095 (284)
Generalized Zagreb index of product graphs [PDF]
Transactions on Combinatorics, 2019 The generalized Zagreb index is an extension of both ordinary and variable Zagreb indices. In this paper, we present exact formulae for the values of the generalized Zagreb index for product graphs.
Mahdieh Azari
doaj +1 more source
On Triangulations with High Vertex Degree [PDF]
Annals of Combinatorics, 2008 We solve three enumerative problems concerning families of planar maps. More precisely, we establish algebraic equations for the generating function of non-separable triangulations in which all vertices have degree at least d, for a certain value d chosen in {3, 4, 5}.
openaire +2 more sources
The topological uniqueness of the deltahedra found in the boranes BnHn2− (6≤n≤12) [PDF]
, 1990 The deltahedra observed experimentally in the borane anions BnHn2− (6≤n≤12) are the only possible n-vertex deltahedra having only degree 4 and 5 vertices.
Duijvestijn, A.J.W., King, R.B.
core +2 more sources
AKCE International Journal of Graphs and Combinatorics, 2020 The two Zagreb indices and are vertex-degree-based graph invariants that have been introduced in the 1970s and extensively studied ever since. In the last few years, a variety of modifications of and were put forward. The present survey of these modified
Ivan Gutman +2 more
doaj +1 more source
Almost sure convergence of vertex degree densities in the vertex splitting model [PDF]
Stochastic Models, 2016 1 ...
Stefánsson, Sigurdur Örn +1 more
openaire +2 more sources
Growing networks with two vertex types [PDF]
, 2003 Growing networks are introduced in which the vertices are allocated one of two possible growth rates; type A with probability p(t), or type B with probability 1−p(t).
Adamic +13 more
core +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
Vertex arboricity and maximum degree
Discrete Mathematics, 1995 This paper mainly proves that if a connected graph \(G= (V,E)\) is neither a cycle nor a clique, then there is a coloring of \(V\) with at most \(\lceil {{\Delta (G)} \over 2} \rceil\) colors such that all color classes induce forests and one of them is a minimum induced forest in \(G\).
Catlin, Paul A., Lai, Hong-Jian
openaire +1 more source
Fuzzy Graph Structures with Application
Mathematics, 2019 In this article, we introduce the notions of maximal products of fuzzy graph structures, regular fuzzy graph structures, and describe these notions with examples and properties.
Muzzamal Sitara +2 more
doaj +1 more source
Minimum Vertex Degree Threshold for ‐tiling* [PDF]
Journal of Graph Theory, 2014 AbstractWe prove that the vertex degree threshold for tiling (the 3‐uniform hypergraph with four vertices and two triples) in a 3‐uniform hypergraph on vertices is , where if and otherwise. This result is best possible, and is one of the first results on vertex degree conditions for hypergraph tiling.
Jie Han, Yi Zhao
openaire +1 more source