Results 11 to 20 of about 18,692 (262)
On Triangulations with High Vertex Degree [PDF]
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
On second Zagreb index and coindex of some derived graphs [PDF]
The second Zagreb index is defined as the sum of the products of the degrees of adjacent vertices. In this note, we examine the second Zagreb indices of some derived graphs and find expressions for these in terms of vertex degrees.
Bommanahal Basavanagoud +2 more
doaj +1 more source
Almost sure convergence of vertex degree densities in the vertex splitting model [PDF]
1 ...
Stefánsson, Sigurdur Örn +1 more
openaire +2 more sources
This paper introduce two types of edge degrees (line degree and near line degree) and total edge degrees (total line degree and total near line degree) of an edge in a fuzzy semigraph, where a fuzzy semigraph is defined as (V, σ, μ, η ...
ARCHANA S., PREETHI KUTTIPULACKAL
doaj +1 more source
On limit distributions of vertex degrees in a configuration graph
The configuration graph where vertex degrees are independent identically distributed random variables is often used for models of complex networks such as the Internet. We consider a random graph consisting of N+1 vertices.
Irina Cheplyukova
doaj +1 more source
Conjecture Involving Arithmetic-Geometric and Geometric-Arithmetic Indices
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
Reformulated Zagreb Indices of Some Derived Graphs
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
Majorization and the number of bipartite graphs for given vertex degrees [PDF]
The emph{bipartite realisation problem} asks for a pair of non-negative, non-increasing integer lists $a:=(a_1,ldots,a_n)$ and $b:=(b_1,ldots,b_{n'})$ if there is a labeled bipartite graph $G(U,V,E)$ (no loops or multiple edges) such that each vertex ...
Annabell Berger
doaj +1 more source
Vertex arboricity and maximum degree
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
On clustering of conditional configuration graphs
We consider configuration graphs with N vertices. The degrees of the vertices are independent identically distributed limited random variables. They are equal to the number of vertex semiedges that are numbered in an arbitrary order.
Yury Pavlov
doaj +1 more source

