Faber-Krahn type inequality for unicyclic graphs
Combinatorics
2012-01-04 v1
Abstract
The Faber-Krahn inequality states that the ball has minimal first Dirichlet eigenvalue among all bounded domains with the fixed volume in . 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.
Cite
@article{arxiv.1201.0455,
title = {Faber-Krahn type inequality for unicyclic graphs},
author = {Guang-Jun Zhang and Jie Zhang and Xiao-Dong Zhang},
journal= {arXiv preprint arXiv:1201.0455},
year = {2012}
}
Comments
13 pages, figures, 13 references; Linear and Multilinear algebra 2012