On the abc spectra radius of unicyclic graphs
WebIn the article, we consider the problem of characterization of connected graphs having exactly three distinct Laplacian ABC-eigenvalues. We solve this problem for bipartite graphs, multipartite graphs, unicyclic graphs, regular graphs and prove the non-existence of such graphs with diameter greater than 2. 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.
On the abc spectra radius of unicyclic graphs
Did you know?
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)). WebSearch 210,104,055 papers from all fields of science. Search. Sign In Create Free Account Create Free Account
Web24 de mar. de 2024 · The largest absolute value of a graph's spectrum is known as its spectral radius . The spectrum of a graph may be computed in the Wolfram Language using Eigenvalues [ AdjacencyMatrix [ g ]]. Precomputed spectra for many named graphs can be obtained using GraphData [ graph , "Spectrum" ]. 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 ...
Web1 de nov. de 2024 · [1] Feng L and Yu G 2009 The Signless Laplacian Spectral Radius of Unicyclic Graphs with Graph Constraints Kyungpook Math. J. 49 123-31 Crossref; Google Scholar [2] Yu G, Wu Y and Shu J 2011 Signless Laplacian spectral radii of graphs with given chromatic number Linear Algebra Appl. 435 1813-22 Crossref; Google Scholar [3] … 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 research you need on ResearchGate
Web9 de mai. de 2024 · The arithmetic-geometric matrix Aag(G) of a graph G is a square matrix, where the (i, j)-entry is equal to di +d j 2 √ did j if the vertices vi and v j are adjacent, and …
Web11 de jan. de 2024 · In this work, we investigate the extremal values on arithmetic–geometric spectral radius of n-vertex unicyclic graphs and characterize the … iphone 11 128 gb turkcellWeb1 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 … iphone 11 128gb womWebON THE ABC SPECTRAL RADIUS OF CACTUS GRAPHS ZHIBINDU ANDBO ZHOU∗ Abstract. Let G be a graph with vertex set V(G). Denote by d u the degree of vertex u in … iphone 11 128gb vs iphone 12 64gbWebThe 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), … iphone 11 128gb schwarz media marktWebSpectral 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. iphone 11 128 hepsiburadaWeb26 de ago. de 2016 · On Unicyclic Graphs Spectra: New Results Abstract: Let G = (V, E) be a unicyclic simple undirected graph. In this paper, we investigate the spectra of a particular class of unicyclic graphs G (q, n1) where q is the size of the unique cycle. Each vertex of the unique cycle is attached to n1 vertices. iphone 11 128 go neuf fnacWebThe weighted adjacency matrix $A_{f}(G)$ of a simple graph $G=(V,E)$ is the $ V \\times V $ matrix whose $ij$-entry equals $f(d_{i},d_j)$, where $f(x,y)$ is a ... iphone 11 128 mb