Characterizing \(\mathcal{P}_{\geqslant 2} \)-factor and \(\mathcal{P}_{\geqslant 2} \)-factor covered graphs with respect to the size or the spectral radius

DOI10.1016/j.disc.2021.112588zbMath1472.05127OpenAlexW3195183063MaRDI QIDQ1981717

Shujing Miao, Shuchao Li

Publication date: 6 September 2021

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

Full work available at URL: https://doi.org/10.1016/j.disc.2021.112588

zbMATH Keywords

spectral radiussize\( \mathcal{P}_{\geqslant 2} \)-factor\( \mathcal{P}_{\geqslant 2} \)-factor covered graph

Mathematics Subject Classification ID

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

Related Items (10)

Spectral radius and fractional perfect matchings in graphs ⋮ Unnamed Item ⋮ Some sufficient conditions for a graph with minimum degree to be \(k\)-factor-critical ⋮ Complete characterization of path-factor and path-factor covered graphs via Q -index and D -index ⋮ Characterizing \(\mathcal{P}_{\geqslant 2}\)-factor deleted graphs with respect to the size or the spectral radius ⋮ Matching extension and matching exclusion via the size or the spectral radius of graphs ⋮ Unnamed Item ⋮ On the \(A_\alpha\)-spectral radius of graphs without large matchings ⋮ The spectral radius and \({\mathcal{P}}_{\ge \ell}\)-factors of graphs involving minimum degree ⋮ Characterizing star factors via the size, the spectral radius or the distance spectral radius of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Spectral radius and fractional matchings in graphs
• Matching and edge-connectivity in regular graphs
• 1-factor covers of regular graphs
• Matchings in regular graphs from eigenvalues
• Characterizations for \({\mathcal{P}}_{\geq 2}\)-factor and \({\mathcal{P}}_{\geq 3}\)-factor covered graphs
• An extension of Tutte's 1-factor theorem
• A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two
• Eigenvalues and perfect matchings
• On the spectrum of an equitable quotient matrix and its application
• Spectral radius and matchings in graphs
• Tight lower bounds on the size of a maximum matching in a regular graph
• Regular Graphs, Eigenvalues and Regular Factors
• Edge-Connectivity, Eigenvalues, and Matchings in Regular Graphs
• Balloons, cut-edges, matchings, and total domination in regular graphs of odd degree
• Sufficient conditions for the existence of a path‐factor which are related to odd components

This page was built for publication: Characterizing \(\mathcal{P}_{\geqslant 2} \)-factor and \(\mathcal{P}_{\geqslant 2} \)-factor covered graphs with respect to the size or the spectral radius