Distance spectrum, 1-factor and vertex-disjoint cycles

DOI10.1016/j.laa.2022.08.034zbMath1498.05178OpenAlexW4295122210WikidataQ114151196 ScholiaQ114151196MaRDI QIDQ2080240

Huiqiu Lin, Yuke Zhang, Qinghai Liu, Jinfeng Zheng

Publication date: 7 October 2022

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

Full work available at URL: https://doi.org/10.1016/j.laa.2022.08.034

zbMATH Keywords

1-factorvertex-disjoint cyclesdistance spectral radius

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12)

Related Items (1)

Characterizing star factors via the size, the spectral radius or the distance spectral radius of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sufficient spectral conditions on Hamiltonian and traceable graphs
• On graphs with a unique perfect matching
• The complexity of computing the permanent
• Spectra of graphs
• Graph invertibility
• Matchings in regular graphs from eigenvalues
• Inverses of trees
• Extremal problems on the Hamiltonicity of claw-free graphs
• Inverses of bipartite graphs
• Eigenvalues and perfect matchings
• On some graphs with a unique perfect matching
• Spectral results on Hamiltonian problem
• A tight lower bound on the matching number of graphs via Laplacian eigenvalues
• Extremal problems on distance spectra of graphs
• Spectral radius and matchings in graphs
• Perfect matching and distance spectral radius in graphs and bipartite graphs
• Distance spectra of graphs: a survey
• On Hamiltonian bipartite graphs
• The distance spectrum of a tree
• Sufficient conditions for Hamiltonian graphs in terms of (signless Laplacian) spectral radius
• Spectral radius and Hamiltonian properties of graphs
• Spectral radius and Hamiltonian properties of graphs, II
• On Independent Circuits Contained in a Graph
• On the Addressing Problem for Loop Switching
• On the maximal number of independent circuits in a graph
• On the maximal number of independent circuits in a graph
• On independent cycles in a bipartite graph

This page was built for publication: Distance spectrum, 1-factor and vertex-disjoint cycles