On the abc spectra radius of unicyclic graphs
Web1 de jul. de 2024 · The 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 … Web13 de jan. de 2024 · We first establish a lower bound on the size and spectral radius of a graph G to guarantee that G contains a ... Spectra of Graphs (Springer, New York, 2011).Google Scholar [4] Godsil, C. and Royle, G., Algebraic Graph Theory, Graduate Texts in ... ‘ On the distance spectral radius of unicyclic graphs with perfect ...
On the abc spectra radius of unicyclic graphs
Did you know?
Web15 de jan. de 2013 · It was conjectured by Li and Feng in 1979 that the unicyclic graph formed by a cycle of order g linking to an endvertex of a path of length k minimizes the spectral radius of all unicyclic graphs of order g + k and girth g. In 1987, Cao proved that this conjecture is true for k ≥ g ( g − 2)/8 and false for k = 2 and sufficiently large g. Web1 de abr. de 2024 · Download Citation On Apr 1, 2024, Yinzhen Mei and others published Extreme Sombor Spectral Radius of Unicyclic Graphs Find, read and cite all the …
Web1 de dez. de 2024 · On the ABC spectra radius of unicyclic graphs Linear Algebra and its Applications, Volume 596, 2024, pp. 71-81 Show abstract Research article Characteristics polynomial of normalized Laplacian for trees Applied Mathematics and Computation, Volume 271, 2015, pp. 838-844 Show abstract Research article http://files.ele-math.com/abstracts/oam-17-05-abs.pdf
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. 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 …
WebFor a k-uniform hypergraph G, the ABC eigenvalues of G are defined as the eigenvalues of its ABC tensor, and in particular, the ABC spectral radius of G is defined as the spectral radius of its ABC tensor, denoted by ρABC(G). That is, ρABC(G) = ρ(ABC(G)).
WebThe spectral radius of a graph is the largest eigenvalue of its adjacency matrix and the first ⌊ g2⌋+ 3 spectral radii of unicyclic graphs in the set U g n are determined. The spectral … dark disciples black cloverWeb1 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 … dark disc golf photoWeb15 de jan. de 2013 · It was conjectured by Li and Feng in 1979 that the unicyclic graph formed by a cycle of order g linking to an endvertex of a path of length k minimizes the … bisha rooftop barWeb15 de jan. de 2007 · AMS classification: 05C50; 15A18 Keywords: Unicyclic graph; Spectral radius; Diameter 1. Introduction Let G = (V, E) be a simple undirected graph … bisharp and lilligantWebThe ABC matrix of a graph G is a square matrix, where the (i,j)-entry ABCij=di+dj−2didj if there is an edge between vertices i and j in G, and ABCij=0 otherwise. The 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(Cn)≤ν1(G)≤ν1(Sn+e), … dark disciple by christie goldenWeb15 de abr. de 2024 · The research about ABC spectral radius (largest eigenvalue of ABC matrix) of graphs is rather active in recent years. In this paper, we characterize the … bisharo scoping reviewWeb1 de abr. de 2024 · Download Citation On Apr 1, 2024, Yinzhen Mei and others published Extreme Sombor Spectral Radius of Unicyclic Graphs Find, read and cite all the research you need on ResearchGate dark dining table light chairs