๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Upper bound to the number of edges of a graph with specified nondensity and all-contiguity numbers

โœ Scribed by N. G. Vinnichenko

Book ID
105057170
Publisher
Springer US
Year
1974
Tongue
English
Weight
157 KB
Volume
8
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.

A new upper bound for the independence n
A new upper bound for the independence number of edge chromatic critical graphs
โœ Rong Luo; Yue Zhao ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 107 KB ๐Ÿ‘ 2 views

In 1968, Vizing conjectured that if G is a -critical graph with n vertices, then (G) โ‰ค n / 2, where (G) is the independence number of G. In this paper, we apply Vizing and Vizing-like adjacency lemmas to this problem and prove that (G)<(((5 -6)n) / (8 -6))<5n / 8 if โ‰ฅ 6. แญง 2010 Wiley

An upper bound on the number of edges of
An upper bound on the number of edges of edge-coloring critical graphs with high maximum degree
โœ Lian-ying Miao; Shi-you Pang; Jian-liang Wu ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 100 KB

In this paper, we prove that any edge-coloring critical graph G with maximum degree ยฟ (11 + โˆš 49 -24 )=2, where 6 1, has the size at least 3(|V (G)| -) + 1 if 6 7 or if ยฟ 8 and |V (G)| ยฟ 2 --4 -( + 6)=( -6), where is the minimum degree of G. It generalizes a result of Sanders and Zhao.