pith. sign in

arxiv: 1201.0455 · v1 · pith:QLJQKHM3new · submitted 2012-01-02 · 🧮 math.CO

Faber-Krahn type inequality for unicyclic graphs

classification 🧮 math.CO
keywords inequalityunicyclicfaber-krahngraphstypeballboundedconditions
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.