On the spectral radii of bicyclic graphs with fixed independence number
Abstract
Bicyclic graph is a connected graph in which the number of edges equals the number of vertices plus one. In this paper, we determine the graph which alone maximizes the spectral radii among all the bicyclic graphs on n vertices with fixed independence number.
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.