Characterizing path-factor deleted graphs via Q-index and D-index
From MaRDI portal
Publication:6980424
Cites work
- \(P_3\)-factors in the square of a tree
- Characterizations for \({\mathcal{P}}_{\geq 2}\)-factor and \({\mathcal{P}}_{\geq 3}\)-factor covered graphs
- Characterizing \(\mathcal{P}_{\geqslant 2} \)-factor and \(\mathcal{P}_{\geqslant 2} \)-factor covered graphs with respect to the size or the spectral radius
- Characterizing \(\mathcal{P}_{\geqslant 2}\)-factor deleted graphs with respect to the size or the spectral radius
- Complete characterization of path-factor and path-factor covered graphs via Q -index and D -index
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- scientific article; zbMATH DE number 3720956 (Why is no real title available?)
- scientific article; zbMATH DE number 193132 (Why is no real title available?)
- scientific article; zbMATH DE number 7691485 (Why is no real title available?)
- Isolated toughness for path factors in networks
- Matrix Analysis
- On packing 3-vertex paths in a graph
- On path-factor critical deleted (or covered) graphs
- Path and cycle factors of cubic bipartite graphs
- Path factors in claw-free graphs
- Path factors in cubic graphs
- Path-factor critical covered graphs and path-factor uniform graphs
- Some results about star-factors in graphs
- Some sufficient conditions for path-factor uniform graphs
- Sun toughness and \(P_{\geq3}\)-factors in graphs
- The A_-spectral radius for path-factors in graphs
- The existence of \(P_{\geq3}\)-factor covered graphs
- The existence of a path-factor without small odd paths
- The existence of path-factor covered graphs
- Toughness, isolated toughness and path factors in graphs
This page was built for publication: Characterizing path-factor deleted graphs via \(Q\)-index and \(\mathcal{D}\)-index
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6980424)