The Aα-spectral radius of trees and unicyclic graphs with given degree sequence
D Li, Y Chen, J Meng - Applied Mathematics and Computation, 2019 - Elsevier
For any real α∈[0, 1], A α (G)= α D (G)+(1− α) A (G) is the A α-matrix of a graph G, where A
(G) is the adjacency matrix of G and D (G) is the diagonal matrix of the degrees of G. This …
(G) is the adjacency matrix of G and D (G) is the diagonal matrix of the degrees of G. This …
The Aα-spectral radius of trees and unicyclic graphs with given degree sequence
D Li, Y Chen, J Meng - Applied Mathematics and Computation, 2019 - ideas.repec.org
For any real α∈[0, 1], Aα (G)= αD (G)+(1− α) A (G) is the Aα-matrix of a graph G, where A (G)
is the adjacency matrix of G and D (G) is the diagonal matrix of the degrees of G. This paper …
is the adjacency matrix of G and D (G) is the diagonal matrix of the degrees of G. This paper …
The Aα -spectral radius of trees and unicyclic graphs with given degree sequence
D Li, Y Chen, J Meng - 2019 - dl.acm.org
For any real α∈[0, 1], A α (G)= α D (G)+(1− α) A (G) is the Aα-matrix of a graph G, where A
(G) is the adjacency matrix of G and D (G) is the diagonal matrix of the degrees of G. This …
(G) is the adjacency matrix of G and D (G) is the diagonal matrix of the degrees of G. This …
The Aα-spectral radius of trees and unicyclic graphs with given degree sequence
D Li, Y Chen, J Meng - Applied Mathematics and …, 2019 - econpapers.repec.org
For any real α∈[0, 1], Aα (G)= αD (G)+(1− α) A (G) is the Aα-matrix of a graph G, where A (G)
is the adjacency matrix of G and D (G) is the diagonal matrix of the degrees of G. This paper …
is the adjacency matrix of G and D (G) is the diagonal matrix of the degrees of G. This paper …