Faber-Krahn type inequality for unicyclic graphs
Abstract
The Faber-Krahn inequality states that the ball has minimal first Dirichlet eigenvalue among all bounded domains with the fixed volume in Rn. 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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.