✦ LIBER ✦

Graphs with given diameter maximizing the spectral radius

✍ Scribed by E.R. van Dam

Publisher: Elsevier Science
Year: 2007
Tongue: English
Weight: 97 KB
Volume: 426
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2007.05.026

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Maximizing the Laplacian spectral radii

Maximizing the Laplacian spectral radii of graphs with given diameter

✍ Mingqing Zhai; Jinlong Shu; Zhonghua Lu 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 166 KB

The minimal spectral radius of graphs wi

The minimal spectral radius of graphs with a given diameter

✍ E.R. van Dam; R.E. Kooij 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 228 KB

On the spectral radius of bipartite grap

On the spectral radius of bipartite graphs with given diameter

✍ 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

Graphs with given diameter maximizing th

Graphs with given diameter maximizing the algebraic connectivity

✍ H. Wang; R.E. Kooij; P. Van Mieghem 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 932 KB

Graphs with maximal signless Laplacian s

Graphs with maximal signless Laplacian spectral radius

✍ Ting-Jung Chang; Bit-Shun Tam 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 340 KB

By the signless Laplacian of a (simple) graph G we mean the matrix , where A(G), D(G) denote respectively the adjacency matrix and the diagonal matrix of vertex degrees of G. It is known that connected graphs G that maximize the signless Laplacian spectral radius ρ(Q (G)) over all connected graphs

Maximizing the spectral radius of bicycl

Maximizing the spectral radius of bicyclic graphs with fixed girth

✍ Mingqing Zhai; Yarong Wu; Jinlong Shu 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 248 KB

Let B(n, g) be the set of bicyclic graphs on n vertices with girth g. In this paper, we determine the unique graph with the maximal spectral radius among all graphs in B(n, g). Moreover, the maximal spectral radius is a decreasing function on g.