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

Upper and lower bounds of the number of edges of a graph with specified compactness, noncompactness, and all-contiguity number

โœ Scribed by N. G. Vinnichenko

Book ID
105056726
Publisher
Springer US
Year
1975
Tongue
English
Weight
420 KB
Volume
9
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 upper bounds for the product of the
Some upper bounds for the product of the domination number and the chromatic number of a graph
โœ Jerzy Topp; Lutz Volkmann ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 199 KB

Topp, J. and L. Volkmann, Some upper bounds for the product of the domination number and the chromatic number of a graph, Discrete Mathematics 118 (1993) 2899292. Some new upper bounds for yx are proved, where y is the domination number and x is the chromatic number of a graph. All graphs consider