
doi: 10.1002/jgt.20581
AbstractIn this article, we obtain a sufficient condition for the existence of regular factors in a regular graph in terms of its third largest eigenvalue. We also determine all values of k such that every r‐regular graph with the third largest eigenvalue at most has a k‐factor.
Graphs and linear algebra (matrices, eigenvalues, etc.), eigenvalue, regular factor
Graphs and linear algebra (matrices, eigenvalues, etc.), eigenvalue, regular factor
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 26 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
