Spectral conditions for graphs in which every edge belongs to a factor
Combinatorics
2024-01-25 v1
Abstract
A factor of a graph is a spanning subgraph. Spectral sufficient conditions are provided via spectral radius and signless Laplacian spectral radius for graphs with (i) a matching of given size (particularly, -factor) containing any given edge, and (ii) a star factor with a component isomorphic to stars of order two or three containing any given edge, respectively.
Keywords
Cite
@article{arxiv.2401.12984,
title = {Spectral conditions for graphs in which every edge belongs to a factor},
author = {Jin Cai and Bo Zhou},
journal= {arXiv preprint arXiv:2401.12984},
year = {2024}
}
Comments
arXiv admin note: substantial text overlap with arXiv:2401.01030