𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The maximum spectral radius of -free graphs of given order and size

✍ Scribed by Vladimir Nikiforov


Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
131 KB
Volume
430
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


On the spectral radius of bipartite grap
✍ Mingqing Zhai; Ruifang Liu; Jinlong Shu πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier Science 🌐 English βš– 123 KB

Let GB(n, d) be the set of bipartite graphs with order n and diam- eter d. This paper characterizes the extremal graph with the maximal spectral radius in GB(n, d). Furthermore, the maximal spectral radius is a decreasing function on d. At last, bipartite graphs with the second largest spectral radi

The Laplacian spectral radius of bicycli
✍ Mingqing Zhai; Guanglong Yu; Jinlong Shu πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 622 KB

Let B(n, g) be the class of bicyclic graphs on n vertices with girth g. Let B 1 (n, g) be the subclass of B(n, g) consisting of all bicyclic graphs with two edge-disjoint cycles and B 2 (n, g) = B(n, g) \ B 1 (n, g). This paper determines the unique graph with the maximal Laplacian spectral radius a

The minimum signless Laplacian spectral
✍ 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 Ξ±