The A_-spectral radius and spanning trees of graphs
Let \(G\) be a connected graph and \(A(G)\) its adjacency matrix. Let \(\alpha\) be a real number \(\alpha\in [0,1]\). The authors of this paper considered the matrix \N\[\NA_\alpha(G) =\alpha D(G)+(1-\alpha )A(G),\N\]\Nwhere \(D(G)\) is the diagonal matrix of vertex degrees of \(D\).\N\NLet \(k\geq 2\) be an integer. A spanning \(k\)-tree of \(G\) is a spanning tree in which every vertex has degree at most \(k\). This paper aims to guarantee the existence of a spanning \(k\)-tree in \(G\), using the \(A_\alpha(G)\)-spectral.\N\NThe main results of this paper are Theorem 1.3 and Theorem 1.5. These results are generalizations of previous results.\N\NIn Section 2, the authors prove Theorem 1.3. As this proof is very complex and lengthy, the authors divide it into several claims. In this way, the proof becomes interesting and easy to read.\N\NThe proof of Theorem 1.5 is the focus of Section 3. The proof is based on known results.\N\NIn my opinion, this paper is an important paper on this matter.
- A sufficient condition for a graph to have a k-tree
- A tight lower bound on the matching number of graphs via Laplacian eigenvalues
- An introduction to the theory of graph spectra
- scientific article; zbMATH DE number 7690926 (Why is no real title available?)
- Independence trees and Hamilton cycles
- Merging the \(A\)- and \(Q\)-spectral theories
- On a connection between the existence of k-trees and the toughness of a graph
- On the Aα-spectral radius of connected graphs
- Spectral radius and spanning trees of graphs
- The \(A_\alpha\)-spectral radius of graphs with a prescribed number of edges for \(\frac{1}{2}\leq\alpha\leq 1\)
- The spanning k-trees, perfect matchings and spectral radius of graphs
- Toughness, trees, and walks
This page was built for publication: The \(A_{\alpha}\)-spectral radius and spanning trees of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6880433)
