Results 21 to 30 of about 178,682 (289)
On limit distributions of vertex degrees in a configuration graph
Transactions of the Karelian Research Centre of the Russian Academy of Sciences, 2015 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
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
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
Majorization and the number of bipartite graphs for given vertex degrees [PDF]
Transactions on Combinatorics, 2018 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
Determining the Solution Space of Vertex-Cover by Interactions and Backbones [PDF]
, 2012 To solve the combinatorial optimization problems especially the minimal Vertex-cover problem with high efficiency, is a significant task in theoretical computer science and many other subjects.
B. Bollobàs +12 more
core +1 more source
Euler tours in hypergraphs [PDF]
, 2020 We show that a quasirandom $k$-uniform hypergraph $G$ has a tight Euler tour subject to the necessary condition that $k$ divides all vertex degrees.
Glock, Stefan +3 more
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
On clustering of conditional configuration graphs
Transactions of the Karelian Research Centre of the Russian Academy of Sciences, 2018 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
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
Limit distributions of vertex degrees in a conditional configuration graph
Transactions of the Karelian Research Centre of the Russian Academy of Sciences, 2018 The configuration graph where vertex degrees are independent identically distributed random variables is often used for modeling of complex networks such as the Internet. We consider a random graph consisting of N vertices.
Irina Chepliukova, Yuri Pavlov
doaj +1 more source