𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Upper bound of the number of edges of a homogeneous connected hypergraph with a given diameter

✍ Scribed by O. G. Rudenskaya

Publisher
Springer US
Year
1980
Tongue
English
Weight
122 KB
Volume
15
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A sharp upper bound for the number of st
A sharp upper bound for the number of stable sets in graphs with given number of cut edges
✍ Hongbo Hua πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier Science 🌐 English βš– 648 KB

Let G be a connected and simple graph, and let i(G) denote the number of stable sets in G. In this letter, we have presented a sharp upper bound for the i(G)-value among the set of graphs with k cut edges for all possible values of k, and characterized the corresponding extremal graphs as well.

Some results on characterizing the edges
Some results on characterizing the edges of connected graphs with a given domination number
✍ Laura A. Sanchis πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 821 KB

A dominatin# set for a graph G = (V, E) is a subset of vertices V' c\_ V such that for all v β€’ V-V' there exists some uβ€’ V' for which {v,u} β€’E. The domination number of G is the size of its smallest dominating set(s). For a given graph G with minimum size dominating set D, let mz(G, D) denote the nu

Sharp upper bounds for Zagreb indices of
Sharp upper bounds for Zagreb indices of bipartite graphs with a given diameter
✍ Shuchao Li; Minjie Zhang πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 255 KB

For a (molecular) graph, the first Zagreb index M 1 is equal to the sum of squares of the vertex degrees, and the second Zagreb index M 2 is equal to the sum of products of the degrees of a pair of adjacent vertices. In this work, we study the Zagreb indices of bipartite graphs of order n with diame