Faber-Krahn type inequality for unicyclic graphs

DOI10.1080/03081087.2011.651722zbMATH Open1254.05112arXiv1201.0455OpenAlexW2050053349MaRDI QIDQ3143339FDOQ3143339

Authors: Jie Zhang, Guangjun Zhang, Xiao-Dong Zhang 

Publication date: 29 November 2012

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

Abstract: The Faber-Krahn inequality states that the ball has minimal first Dirichlet eigenvalue among all bounded domains with the fixed volume in $mathbb{R}^n$. In this paper, we investigate the similar inequality for unicyclic graphs. The results show that the Faber-Krahn type inequality also holds for unicyclic graphs with a given graphic unicyclic degree sequence with minor conditions.

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

Recommendations

• Faber-Krahn type inequalities for unicyclic graphs with the same boundaries
• The Faber-Krahn type isoperimetric inequalities for a graph
• scientific article; zbMATH DE number 1308952
• Faber-Krahn type inequalities for trees
• A Faber-Krahn inequality for Robin problems in any space dimension

zbMATH Keywords

first Dirichlet eigenvalue of unicyclic graphs

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (1)

• 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3143339)