The Least Eigenvalue of Unicyclic Graphs with Application to Spectral Spread
-
Published:2022-04-30
Issue:02
Volume:29
Page:265-272
-
ISSN:1005-3867
-
Container-title:Algebra Colloquium
-
language:en
-
Short-container-title:Algebra Colloq.
Author:
Guo Jiming1,
Zhang Gege1,
Wang Zhiwen1,
Tong Panpan1
Affiliation:
1. School of Mathematics, East China University of Science and Technology, Shanghai 200237, China
Abstract
Let [Formula: see text] be the set of connected unicyclic graphs of order [Formula: see text] and girth [Formula: see text]. Let [Formula: see text] be obtained from a cycle [Formula: see text] (in an anticlockwise direction) by identifying [Formula: see text] with the root of a rooted tree [Formula: see text] of order [Formula: see text] for each [Formula: see text], where [Formula: see text] and [Formula: see text]. In this note, the graph with the minimal least eigenvalue (and the graph with maximal spread) in [Formula: see text] is determined.
Publisher
World Scientific Pub Co Pte Ltd
Subject
Applied Mathematics,Algebra and Number Theory