Characterizing star factors via the size, the spectral radius or the distance spectral radius of graphs
From MaRDI portal
Publication:2109106
DOI10.1016/j.dam.2022.11.006zbMath1504.05176OpenAlexW4310425679MaRDI QIDQ2109106
Publication date: 20 December 2022
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2022.11.006
Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12)
Related Items (2)
Fractional matching, factors and spectral radius in graphs involving minimum degree ⋮ Some sufficient conditions for a graph with minimum degree to be \(k\)-factor-critical
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Star-factors with large components
- On factors with given components
- Component factors with large components in graphs
- 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
- Distance spectrum, 1-factor and vertex-disjoint cycles
- On the \(A_\alpha\)-spectral radius of graphs without large matchings
- Spectral radius, edge-disjoint cycles and cycles of the same length
- Spectral radius and \([a,b\)-factors in graphs]
- Spectral radius and matchings in graphs
- Star-like factors with large components
- Inverses of triangular matrices and bipartite graphs
- Tight lower bounds on the size of a maximum matching in a regular graph
- Matrix Analysis
- The 1-Factors of Oriented Graphs
This page was built for publication: Characterizing star factors via the size, the spectral radius or the distance spectral radius of graphs
