ISSN:
1435-5914
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
,
Mathematics
Notes:
Abstract LetG be a graph onn vertices. Denote byL(G) the difference between the diagonal matrix of vertex degrees and the adjacency matrix. It is not hard to see thatL(G) is positive semidefinite symmetric and that its second smallest eigenvalue,a(G) 〉 0, if and only ifG is connected. This observation led M. Fiedler to calla(G) thealgebraic connectivity ofG. Given two trees,T 1 andT 2, the authors explore a graph theoretic interpretation for the difference betweena(T 1) anda(T 2).
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01787574
Permalink