Graphs of given order and size and minimum algebraic connectivity

DOI10.1016/j.laa.2011.09.026zbMath1238.05140OpenAlexW2118709461MaRDI QIDQ2427902

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

Publication date: 19 April 2012

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

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0024379511006628

zbMATH Keywords

Fiedler vectorAlgebraic connectivityAutoGraphiXGraph Laplacian

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Structural characterization of families of graphs (05C75)

Related Items (5)

On the spectral gap of a quantum graph ⋮ Unnamed Item ⋮ Ordering trees and graphs with few cycles by algebraic connectivity ⋮ The maximum relaxation time of a random walk ⋮ Hamiltonian graphs of given order and minimum algebraic connectivity

Cites Work

• Faber-Krahn type inequalities for trees
• Old and new results on algebraic connectivity of graphs
• Algebraic connectivity and degree sequences of trees
• Some geometric aspects of graphs and their eigenfunctions
• Chromatic number and the 2-rank of a graph
• Some results on the index of unicyclic graphs
• Laplacian eigenvectors of graphs. Perron-Frobenius and Faber-Krahn type theorems
• The perturbed laplacian matrix of a graph
• Characteristic vertices of weighted trees via perron values
• Extremizing algebraic connectivity subject to graph theoretic constraints
• Discrete nodal domain theorems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Graphs of given order and size and minimum algebraic connectivity