𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Spectral radius of graphs with given matching number

✍ Scribed by Lihua Feng; Guihai Yu; Xiao-Dong Zhang

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

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

Spectral radius of digraphs with given d
Spectral radius of digraphs with given dichromatic number
✍ Huiqiu Lin; Jinlong Shu πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 237 KB

Let D be a digraph with vertex set V (D). A partition of V (D) into k acyclic sets is called a k-coloring of D. The minimum integer k for which there exists a k-coloring of D is the dichromatic number Ο‡(D) of the digraph D. Denote G n,k the set of the digraphs of order n with the dichromatic number