Arithmetic-Geometric spectral radii of Unicyclic graphs

Abstract

Let dvi be the degree of the vertex vi of G. The arithmetic-geometric matrix Aag(G) of a graph G is a square matrix, where the (i,j)-entry is equal to dvi+dvj2dvidvj if the vertices vi and vj are adjacent, and 0 otherwise. The arithmetic-geometric spectral radius of G, denoted by ag(G), is the largest eigenvalue of the arithmetic-geometric matrix Aag(G). In this paper, the unicyclic graphs of order n≥5 with the smallest and first four largest arithmetic-geometric spectral radii are determined.

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…