✦ LIBER ✦

Graphs with given diameter maximizing the algebraic connectivity

✍ Scribed by H. Wang; R.E. Kooij; P. Van Mieghem

Publisher: Elsevier Science
Year: 2010
Tongue: English
Weight: 932 KB
Volume: 433
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2010.06.051

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Graphs with given diameter maximizing th

Graphs with given diameter maximizing the spectral radius

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

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

Graphs with given connectivity propertie

Graphs with given connectivity properties

✍ Lawrencenko, Serge; Luo, Qiang 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 98 KB

A node of a graph G, thought of as representing a communication network, is said to be redundant provided that its removal does not diminish the connectivity. In constructing networks, we require reliable connectedness in addition to the usual requirement of reliability (i.e., the higher the connect

Ordering trees with algebraic connectivi

Ordering trees with algebraic connectivity and diameter

✍ Xiao-Dong Zhang 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 186 KB

The least eigenvalue of graphs with give

The least eigenvalue of graphs with given connectivity

✍ Miao-Lin Ye; Yi-Zheng Fan; Dong Liang 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 131 KB

The algebraic connectivity of lollipop g

The algebraic connectivity of lollipop graphs

✍ Ji-Ming Guo; Wai Chee Shiu; Jianxi Li 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 222 KB