On the maximum Aα-spectral radius of unicyclic and bicyclic graphs with fixed girth or fixed number of pendant vertices

Abstract

For a connected graph G, let A(G) be the adjacency matrix of G and D(G) be the diagonal matrix of the degrees of the vertices in G. The Aα-matrix of G is defined as align* Aα (G) = α D(G) + (1-α) A(G) for any α ∈ [0,1]. align* The largest eigenvalue of Aα(G) is called the Aα-spectral radius of G. In this article, we characterize the graphs with maximum Aα-spectral radius among the class of unicyclic and bicyclic graphs of order n with fixed girth g. Also, we identify the unique graphs with maximum Aα-spectral radius among the class of unicyclic and bicyclic graphs of order n with k pendant vertices.

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…