Complete characterization of path-factor and path-factor covered graphs via Q -index and D -index
DOI10.1080/03081087.2022.2158166zbMath1530.05150OpenAlexW4313401778MaRDI QIDQ6177673
Publication date: 17 January 2024
Published in: Linear and Multilinear Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03081087.2022.2158166
\(Q\)-index\(\mathcal{P}_{\geqslant 2}\)-factor\(\mathcal{P}_{\geqslant 2}\)-factor covered graph\(D\)-index
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Factors and factorizations of graphs. Proof techniques in factor theory
- Spectra of graphs
- Matchings in regular graphs from eigenvalues
- Characterizations for \({\mathcal{P}}_{\geq 2}\)-factor and \({\mathcal{P}}_{\geq 3}\)-factor covered graphs
- On factors with all degrees odd
- 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
- Characterizing \(\mathcal{P}_{\geqslant 2} \)-factor and \(\mathcal{P}_{\geqslant 2} \)-factor covered graphs with respect to the size or the spectral radius
- On the spectrum of an equitable quotient matrix and its application
- Spectral radius and matchings in graphs
- Perfect matching and distance spectral radius in graphs and bipartite graphs
- Adjacency eigenvalues of graphs without short odd cycles
- Graph Factors and Matching Extensions
- Matrix Analysis
- The Factorization of Linear Graphs
This page was built for publication: Complete characterization of path-factor and path-factor covered graphs via Q -index and D -index