Ordering trees by algebraic connectivity

Autor:	Robert Grone, Russell Merris
Rok vydání:	1990
Předmět:	Discrete mathematics Combinatorics Algebraic connectivity Graph energy Degree matrix Seidel adjacency matrix Diagonal matrix Discrete Mathematics and Combinatorics Adjacency matrix Eigenvalues and eigenvectors Theoretical Computer Science Mathematics Vertex (geometry)
Zdroj:	Graphs and Combinatorics. 6:229-237
ISSN:	1435-5914 0911-0119
Popis:	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,T1 andT2, the authors explore a graph theoretic interpretation for the difference betweena(T1) anda(T2).
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::78ef7cb7cce23e2929296450f5e40686 https://doi.org/10.1007/bf01787574 Zobrazit plný text záznamu Full text from SpringerLink