Spectral radius and spanning trees of graphs

DOI10.1016/j.disc.2023.113400zbMath1521.05096arXiv2212.05455MaRDI QIDQ6041529

Jinjiang Yuan, Rui-fang Liu, Guoyan Ao

Publication date: 31 May 2023

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

spectral radiusspanning treeclosureleaf degree

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)

Cites Work

• Unnamed Item
• Unnamed Item
• Spectral radius and Hamiltonian graphs
• Spanning 3-ended trees in \(k\)-connected \(K_{1,4}\)-free graphs
• Sufficient spectral conditions on Hamiltonian and traceable graphs
• Spanning trees with at most \(k\) leaves in \(K_{1,4}\)-free graphs
• Signless Laplacian spectral radius and Hamiltonicity
• Spanning trees with at most 3 leaves in \(K_{1,4}\)-free graphs
• A bound on the spectral radius of graphs
• On a conjecture of Las Vergnas concerning certain spanning trees in graphs
• A method in graph theory
• Maximizing the sum of the squares of the degrees of a graph
• Spectral results on Hamiltonian problem
• Spanning \(k\)-ended trees in quasi-claw-free graphs
• Neighborhood unions and extremal spanning trees
• Spanning trees with few leaves
• A note on Hamiltonian circuits
• Spectral analogues of Erdős’ and Moon–Moser’s theorems on Hamilton cycles
• Some sufficient spectral conditions on Hamilton-connected and traceable graphs
• Note on Hamilton Circuits
• On three conjectures involving the signless Laplacian spectral radius of graphs
• Independence trees and Hamilton cycles
• Spectral radius and Hamiltonian properties of graphs
• Spectral radius and Hamiltonicity of graphs
• Spanning trees with at most 4 leaves in \(K_{1, 5}\)-free graphs
• Spanning trees with constraints on the leaf degree

This page was built for publication: Spectral radius and spanning trees of graphs