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

Primitive graphs with given exponents and minimum number of edges

โœ Scribed by Byeong Moon Kim; Byung Chul Song; Woonjae Hwang

Publisher
Elsevier Science
Year
2007
Tongue
English
Weight
364 KB
Volume
420
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The number of cutvertices in graphs with
The number of cutvertices in graphs with given minimum degree
โœ L.H. Clark; R.C. Entringer ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 453 KB

The maximum number of cutvertices in a connected graph of order n having minimum degree at least 6 is determined for 6 > 5.

On the independent domination number of
On the independent domination number of graphs with given minimum degree
โœ N.I. Glebov; A.V. Kostochka ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 175 KB

We prove a new upper bound on the independent domination number of graphs in terms of the number of vertices and the minimum degree. This bound is slightly better than that of Haviland (1991) and settles the case 6 = 2 of the corresponding conjecture by Favaron (1988). @ 1998 Elsevier Science B.V. A

The minimum signless Laplacian spectral
The minimum signless Laplacian spectral radius of graphs with given independence number
โœ Ruilin Li; Jinsong Shi ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 307 KB

The independence number ฮฑ(G) of G is defined as the maximum cardinality of a set of pairwise non-adjacent vertices which is called an independent set. In this paper, we characterize the graphs which have the minimum spectral radius among all the connected graphs of order n with independence number ฮฑ