Maximizing the A_ -spectral radius of graphs with given size and diameter

DOI10.1016/J.LAA.2022.06.020MaRDI QIDQ2158278zbMATH OpenOpenAlexWikidataFDO

Authors Yanyan Li

Publication date 26 July 2022

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.laa.2022.06.020

zbMATH Keywords

\( A_\alpha \)-spectral radiusconnected graphsdiametersize

Mathematics Subject Classification ID

Distance in graphs (05C12) Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Review text

This paper deals with the characterization of the graphs with maximal \(A_\alpha\) spectral radius, where \(\alpha\in [0,1]\). The main result is Theorem 3.3. In this theorem we can see the characterization of these graphs when \(\alpha \in [\frac{1}{2},1)\). The proof of this result is long but describes a process that is not true when \(\alpha \in [0,\frac{1}{2})\). The techniques used in the proofs of the results are not easy but they are good proofs and give us a partial solution for this problem.

Recommendations

• On the A_ -spectral radius of graphs with given size and diameter
• On the \(A_\alpha\)-spectral radius of a graph
• Graphs whose \(A_\alpha \) -spectral radius does not exceed 2
• The \(A_{\alpha}\) spectral radius characterization of some digraphs
• A note on the \(A_{\alpha}\)-spectral radius of graphs

Cites work

• Graph theory
• Maxima of \(L\)-index and \(Q\)-index: graphs with given size and diameter
• Maximizing the Laplacian spectral radii of graphs with given diameter
• Maximizing the signless Laplacian spectral radius of \(k\)-connected graphs with given diameter
• Maximizing the signless Laplacian spectral radius of graphs with given diameter or cut vertices
• Maximizing the spectral radius of k-connected graphs with given diameter
• Merging the \(A\)- and \(Q\)-spectral theories
• On the \(\alpha\)-index of graphs with pendent paths
• On the \(A_\alpha\)-spectral radius of a graph
• On the \(A_{\alpha}\)-spectra of trees
• On the Spectral Radius of Complementary Acyclic Matrices of Zeros and Ones
• The Laplacian spectral radius of some bipartite graphs
• The minimum spectral radius of signless Laplacian of graphs with a given clique number
• The signless Laplacian spectral radius of graphs with a prescribed number of edges

Cited in

(14)

• On the \(A_\alpha\)-spectral radius of a graph
• On the A_ -spectral radius of graphs with given size and diameter
• Maxima of the Laplacian spectral radius of (minimally) 2-connected graphs with fixed size
• Maximizing the signless Laplacian spectral radius of minimally 3-connected graphs with given size
• \(A_{\alpha}\)-spectral extrema of graphs with given size and matching number
• On Aα-spectrum of joined union of graphs and its applications to power graphs of finite groups
• Some extremal problems on A_ -spectral radius of graphs with given size
• Maxima of the A_-index of graphs with given size and domination number
• Maxima of the Q ( L )-index of (minimally) 2-edge-connected graphs with given size
• Maxima of the A_-spectral radius of graphs with given size and minimum degree 2
• Ordering graphs with fixed size and girth by their \(A_{\alpha}\)-spectral radius
• Ordering of graphs with fixed size and diameter by A _α -spectral radii
• Clique trees with a given zero forcing number maximizing the A_-spectral radius
• Maximizing the spectral radius of k-connected graphs with given diameter

This page was built for publication: Maximizing the \(A_\alpha \)-spectral radius of graphs with given size and diameter

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2158278)