Web1 de jul. de 2024 · The ABC spectral radius of a graph G is the largest eigenvalue of the ABC matrix of G, whose (u,v)-entry is du+dv−2dudv if uv∈E (G) and 0 otherwise for … Web1 de mar. de 2024 · Request PDF On the ABC spectra radius of unicyclic graphs The ABC matrix of a graph G is a square matrix, where the (i,j)-entry ABCij=di+dj−2didj if …

On the ABC spectra radius of unicyclic graphs - Researcher An …

http://files.ele-math.com/abstracts/oam-17-05-abs.pdf high school games today near me

The maximal geometric-arithmetic energy of trees with at most …

Web[25] Bao, Y.–H., Tan, Y.Y., Fan, Y.–Z.The Laplacian spread of unicyclic graphs. Appl. Math. Lett., 22 ( 2009 ), 1011–1015. Google Scholar [26] Bapat, R.B., Lal, A.K., Pati, S.On algebraic connectivity of graphs with at most two points of articulation in each block. Linear Multilinear Algebra, 60 ( 2012 ), 415–432. Google Scholar WebSpectral Radius of Graphs provides a thorough overview of important results on the spectral radius of adjacency matrix of graphs that have appeared in the literature in the preceding ten years, most of them with proofs, and including some previously unpublished results of the author. WebThe ABC spectral radius of G, denoted by ν 1 ( G ) , is the largest eigenvalue of the ABC matrix of G. In this paper, we prove that for a unicyclic graph G of order n ≥ 4 , 2 = ν 1 ( C n ) ≤ ν 1 ( G ) ≤ ν 1 ( S n + e ) , with equality if and only if G ≅ C n for the lower bound, and if and only if G ≅ S n + e for the upper bound. high school gangs