Characterizing \(\mathcal{P}_{\geqslant 2}\)-factor deleted graphs with respect to the size or the spectral radius
DOI10.1007/s40840-023-01619-7zbMath1530.05101OpenAlexW4389564931MaRDI QIDQ6186333
Publication date: 9 January 2024
Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40840-023-01619-7
spectral radiussize\(\mathcal{P}_{\geqslant 2}\)-factor deleted\(\mathcal{P}_{\geqslant 3}\)-factor deleted
Paths and cycles (05C38) 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
- Spectral condition for Hamiltonicity of a graph
- Matchings in regular graphs from eigenvalues
- Characterizations for \({\mathcal{P}}_{\geq 2}\)-factor and \({\mathcal{P}}_{\geq 3}\)-factor covered graphs
- A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two
- The existence of a path-factor without small odd paths
- Eigenvalues and perfect matchings
- Packing paths of length at least two
- 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
- On \(P_{\geq 3}\)-factor deleted graphs
- Path factors in subgraphs
- Spectral radius and matchings in graphs
- Binding number conditions for \(P_{\geq 2}\)-factor and \(P_{\geq 3}\)-factor uniform graphs
- \(P_3\)-factors in the square of a tree
- Regular Graphs, Eigenvalues and Regular Factors
- Eigenvalues and triangles in graphs
- Spectral radius and Hamiltonicity of graphs
- Eigenvalues and [a,b‐factors in regular graphs]
This page was built for publication: Characterizing \(\mathcal{P}_{\geqslant 2}\)-factor deleted graphs with respect to the size or the spectral radius
