Maximizing the \(A_\alpha \)-spectral radius of graphs with given size and diameter (Q2158278)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Maximizing the \(A_\alpha \)-spectral radius of graphs with given size and diameter |
scientific article |
Statements
Maximizing the \(A_\alpha \)-spectral radius of graphs with given size and diameter (English)
0 references
26 July 2022
0 references
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.
0 references
\( A_\alpha \)-spectral radius
0 references
connected graphs
0 references
size
0 references
diameter
0 references
0 references
0 references