Spectral sufficient conditions for graph factors containing any edge

DOI10.1051/RO/2024153MaRDI QIDQ6658863

Jin Cai, Bo Zhou

Publication date: 8 January 2025

Published in: RAIRO. Operations Research (Search for Journal in Brave)

zbMATH Keywords

spectral radius1-factorsignless Laplacian spectral radiusstar factor

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• On the \(A_{\alpha}\)-spectra of trees
• Spectral conditions for some graphical properties
• On 2-factors with given properties in claw-free graphs
• Spectra of graphs
• On defect-d matchings in graphs
• The spectral radius of trees on \(k\) pendant vertices
• Star-factors in graphs with large minimum degree
• Characterizing \(\mathcal{P}_{\geqslant 2} \)-factor and \(\mathcal{P}_{\geqslant 2} \)-factor covered graphs with respect to the size or the spectral radius
• Some existence theorems on path factors with given properties in graphs
• Spectral radius and matchings in graphs
• Sharp upper and lower bounds for largest eigenvalue of the Laplacian matrices of trees
• A theorem on connected graphs in which every edge belongs to a 1-factor
• Matchings in graphs from the spectral radius
• The \(A_\alpha\)-spectral radius for path-factors in graphs

This page was built for publication: Spectral sufficient conditions for graph factors containing any edge

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6658863)