Spectral conditions for factor-criticality of graphs

Jin Cai; Bo Zhou

Spectral conditions for factor-criticality of graphs

Combinatorics 2024-01-03 v1

Authors: Jin Cai , Bo Zhou

Abstract

A graph $G$ is $k$ -factor-critical if $G-S$ has a perfect matching for any $k$ -subset $S$ of the vertex set of $G$ . In this paper, we investigate the factor-criticality of graphs with fixed minimum degree and provide sufficient conditions for such graphs to be $k$ -factor-critical in terms of spectral radius and signless Laplacian spectral radius.

Keywords

k-factor-critical spectral radius signless Laplacian spectral radius minimum degree perfect matching

Cite

@article{arxiv.2401.01030,
  title  = {Spectral conditions for factor-criticality of graphs},
  author = {Jin Cai and Bo Zhou},
  journal= {arXiv preprint arXiv:2401.01030},
  year   = {2024}
}

Related papers

View all related →