✦ LIBER ✦

Graphs of given order and size and minimum algebraic connectivity

✍ Scribed by Türker Bıyıkoğlu; Josef Leydold

Book ID: 113772133
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 364 KB
Volume: 436
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2011.09.026

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The minimum size of -rainbow connected g

The minimum size of -rainbow connected graphs of given order

✍ Bode, Jens-P.; Harborth, Heiko 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 494 KB

The minimum restricted edge-connected gr

The minimum restricted edge-connected graph and the minimum size of graphs with a given edge–degree

✍ Yang, Weihua; Tian, Yingzhi; Li, Hengzhe; Li, Hao; Guo, Xiaofeng 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 419 KB

Order of a Graph with given Vertex and E

Order of a Graph with given Vertex and Edge Connectivity and Minimum Degree

✍ Mohit Singh; Amitabha Tripathi 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 120 KB

Minimum order graphs with specified diam

Minimum order graphs with specified diameter, connectivity, and regularity

✍ V. Krishnamoorthy; K. Thulasiraman; M. N. S. Swamy 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 977 KB

The ordering of trees and connected grap

The ordering of trees and connected graphs by algebraic connectivity

✍ Jia-Yu Shao; Ji-Ming Guo; Hai-Ying Shan 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 235 KB

In this paper, we first determine that the first four trees of order n 9 with the smallest algebraic connectivity are P n , Q n , W n and Z n with α(P n ) < α(Q n ) < α(W n ) < α(Z n ) < α(T ), where T is any tree of order n other than P n , Q n , W n , and Z n . Then we consider the effect on the L

Algebraic connectivity of directed graph

Algebraic connectivity of directed graphs

✍ Wu, Chai Wah 📂 Article 📅 2005 🏛 Taylor and Francis Group 🌐 English ⚖ 210 KB