{
  "id": "2402.13601",
  "version": "v2",
  "published": "2024-02-21T08:08:00.000Z",
  "updated": "2024-10-09T13:00:04.000Z",
  "title": "A spectral condition for a graph having a strong parity factor",
  "authors": [
    "Sizhong Zhou",
    "Tao Zhang",
    "Qiuxiang Bian"
  ],
  "comment": "11 pages",
  "journal": "Discrete Applied Mathematics 360(2025)188-195",
  "categories": [
    "math.CO"
  ],
  "abstract": "A graph $G$ contains a strong parity factor $F$ if for every subset $X\\subseteq V(G)$ with $|X|$ even, $G$ has a spanning subgraph $F$ satisfying $\\delta(F)\\geq1$, $d_F(u)\\equiv1$ (mod 2) for any $u\\in X$, and $d_F(v)\\equiv0$ (mod 2) for any $v\\in V(G)\\setminus X$. In this paper, we give a spectral radius condition to guarantee that a connected graph contains a strong parity factor.",
  "revisions": [
    {
      "version": "v2",
      "updated": "2024-10-09T13:00:04.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C50",
      "05C70"
    ],
    "keywords": [
      "strong parity factor",
      "spectral condition",
      "spectral radius condition",
      "connected graph contains",
      "spanning subgraph"
    ],
    "tags": [
      "journal article"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 11,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}