Faber–Krahn type inequality for unicyclic graphs

DOI10.1080/03081087.2011.651722zbMath1254.05112arXiv1201.0455OpenAlexW2050053349MaRDI QIDQ3143339

Jie Zhang, Xiao Dong Zhang, Guang-Jun Zhang

Publication date: 29 November 2012

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

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

zbMATH Keywords

first Dirichlet eigenvalue of unicyclic graphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vertex degrees (05C07)

Cites Work

• Faber-Krahn type inequalities for trees
• The Laplacian spectral radii of trees with degree sequences
• On the spectral radius of unicyclic graphs with prescribed degree sequence
• The signless Laplacian spectral radius of graphs with given degree sequences
• The majorization theorem of connected graphs
• Some geometric aspects of graphs and their eigenfunctions
• The geometry of regular trees with the Faber-Krahn property
• A Faber-Krahn-type inequality for regular trees
• A combinatorial Laplacian with vertex weights
• Discrete convolution-rearrangement inequalities and the Faber-Krahn inequality on regular trees

This page was built for publication: Faber–Krahn type inequality for unicyclic graphs