Algebraic connectivity and degree sequences of trees

DOI10.1016/j.laa.2008.09.030zbMath1151.05041arXiv0810.0966OpenAlexW2006505398MaRDI QIDQ959888

Josef Leydold, Türker Bıyıkoğlu

Publication date: 12 December 2008

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0810.0966

zbMATH Keywords

treedegree sequencealgebraic connectivityFiedler vectorgraph LaplacianDirichlet matrix

Mathematics Subject Classification ID

Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Structural characterization of families of graphs (05C75)

Related Items (6)

The algebraic connectivity of graphs with given matching number ⋮ Graphs of given order and size and minimum algebraic connectivity ⋮ Ordering trees and graphs with few cycles by algebraic connectivity ⋮ On the sum of the two largest Laplacian eigenvalues of trees ⋮ Hamiltonian graphs of given order and minimum algebraic connectivity ⋮ On the algebraic connectivity of some caterpillars: a sharp upper bound and a total ordering

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Old and new results on algebraic connectivity of graphs
• Eigenfunctions and nodal sets
• Some geometric aspects of graphs and their eigenfunctions
• Chromatic number and the 2-rank of a graph
• The ordering of trees and connected graphs by algebraic connectivity
• Laplacian eigenvectors of graphs. Perron-Frobenius and Faber-Krahn type theorems
• Characteristic vertices of weighted trees via perron values
• Algebraic connectivity of weighted trees under perturbation
• Extremizing algebraic connectivity subject to graph theoretic constraints
• Algebraic connectivity and the characteristic set of a graph
• Discrete nodal domain theorems

This page was built for publication: Algebraic connectivity and degree sequences of trees