Extremal ABS Spectral Radius in Bicyclic and Bipartite Unicyclic Graphs

Abstract

The ABS spectral radius of a graph G is defined as the largest eigenvalue of its ABS matrix. Motivated by recent studies on this parameter, in this paper, we determine the bipartite unicyclic graphs that attain the largest ABS spectral radius. Furthermore, we characterize the bicyclic graphs that attain the largest and the second largest ABS spectral radii.

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…