๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Algebraic Connectivity of Connected Graphs with Fixed Number of Pendant Vertices

โœ Scribed by Arbind Kumar Lal; Kamal Lochan Patra; Binod Kumar Sahoo

Publisher
Springer Japan
Year
2010
Tongue
English
Weight
392 KB
Volume
27
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

Interpolation theorem for the number of
Interpolation theorem for the number of pendant vertices of connected spanning subgraphs of equal size
โœ C.A. Barefoot ๐Ÿ“‚ Article ๐Ÿ“… 1984 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 162 KB

At the 4th International Graph Theory Conference (1980), G. Chartrand posed the following problem: If a (connected) graph G contains spanning trees with m and n pendant vertices, respectively, with m < n, does G contain a spanning tree with k pendant vertices for every integer k, where m<k<n? Recent