The spanning k-trees, perfect matchings and spectral radius of graphs

DOI10.1080/03081087.2021.1985055OpenAlexW3205998195MaRDI QIDQ5888899

Huiqiu Lin, Xueyi Huang, Dandan Fan, Sergey Viktorovich Goryainov

Publication date: 25 April 2023

Published in: Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2103.14323

zbMATH Keywords

spectral radius\(k\)-treeperfect matching

Mathematics Subject Classification ID

Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (5)

Spectral radius and fractional perfect matchings in graphs ⋮ Some sufficient conditions for a graph with minimum degree to be \(k\)-factor-critical ⋮ Spectral bounds for the vulnerability parameters of graphs ⋮ \(\mathcal{D}\)-index and \(\mathcal{Q}\)-index for spanning trees with leaf degree at most \(k\) in graphs ⋮ Toughness, Hamiltonicity and spectral radius in graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Spectral radius and fractional matchings in graphs
• On the signless Laplacian index of cacti with a given number of pendant vertices
• Sufficient spectral conditions on Hamiltonian and traceable graphs
• Signless Laplacian spectral radius and fractional matchings in graphs
• Large matchings from eigenvalues
• Matchings in regular graphs from eigenvalues
• A bound on the spectral radius of graphs
• On a connection between the existence of k-trees and the toughness of a graph
• Spanning trees with bounded degrees
• On the spectral radius of unicyclic graphs with perfect matchings
• Eigenvalues and perfect matchings
• Maximizing the sum of the squares of the degrees of a graph
• Spanning spiders and light-splitting switches
• On the spectral radius of graphs with cut edges
• Spectral radius and matchings in graphs
• Sharp upper and lower bounds for largest eigenvalue of the Laplacian matrices of trees
• Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs
• Toughness, trees, and walks
• Spectral radius and Hamiltonian properties of graphs
• Fractional matching number and eigenvalues of a graph
• Spanning trees with many leaves

This page was built for publication: The spanning k-trees, perfect matchings and spectral radius of graphs