On the spectral radius of unicyclic and bicyclic graphs with a fixed diameter

Abstract

The α-spectral radius of a connected graph G is the spectral radius of Aα-matrix of G. In this paper, we discuss the methods for comparing α-spectral radius of graphs. As applications, we characterize the graphs with the maximal α-spectral radius among all unicyclic and bicyclic graphs of order n with diameter d, respectively. Finally, we determine the unique graph with maximal signless Laplacian spectral radius among bicyclic graphs of order n with diameter d.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…