𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the independence number of minimum distance graphs

✍ Scribed by G. Csizmadia

Publisher
Springer
Year
1998
Tongue
English
Weight
332 KB
Volume
20
Category
Article
ISSN
0179-5376

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

On the independence number of random gra
On the independence number of random graphs
✍ A.M. Frieze πŸ“‚ Article πŸ“… 1990 πŸ› Elsevier Science 🌐 English βš– 239 KB

Let (Y(G~,~) denote the independence number of the random graph Gn,p. Let d = np. We show that if E > 0 is fixed then with probability going to 1 as n + m cu(G& -$t (log d -log log dlog 2 + 1) < 7 provided d, s d = o(n), where d, is some fixed constant.

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 Ξ±

The minimum independence number for desi
The minimum independence number for designs
✍ David A. Grable; Kevin T. Phelps; VojtΔ›ch RΓΆdl πŸ“‚ Article πŸ“… 1995 πŸ› Springer-Verlag 🌐 English βš– 432 KB