Faber-Krahn type inequality for unicyclic graphs

preprint2012arXivOpen access

Abstract

The Faber-Krahn inequality states that the ball has minimal first Dirichlet eigenvalue among all bounded domains with the fixed volume in Rn\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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.