Spectral condition for k-factor-criticality in t-connected graphs

Tingyan Ma; Edwin R. van Dam; Ligong Wang

doi:10.1016/j.dam.2025.12.019

Spectral condition for k-factor-criticality in t-connected graphs

Tingyan Ma
, Edwin R. van Dam
, Ligong Wang

Research output: Contribution to journal › Article › Scientific › peer-review

Abstract

A graph G is called k-factor-critical if G - S has a perfect matching for every S subset of V(G) with |S| = k. A connected graph G is called t-connected if it has more than t vertices and remains connected whenever fewer than t vertices are removed. We give a condition on the number of edges and a condition on the spectral radius for k-factor-criticality in t-connected graphs. (c) 2025 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.

Original language	English
Pages (from-to)	310-316
Number of pages	7
Journal	Discrete Applied Mathematics
Volume	382
Early online date	Dec 2025
DOIs	https://doi.org/10.1016/j.dam.2025.12.019
Publication status	Published - 31 Mar 2026

Keywords

Closure
Spectral radius
K-factor-critical graphs
T-connected

Access to Document

10.1016/j.dam.2025.12.019

Embargoed Document

1-s2.0-S0166218X25007267-main
Final published version, 433 KB
Licence: Taverne
Embargo ends: 12/06/26

Cite this

@article{c7bfc504af734d849c40798382195eaa,

title = "Spectral condition for k-factor-criticality in t-connected graphs",

abstract = "A graph G is called k-factor-critical if G - S has a perfect matching for every S subset of V(G) with |S| = k. A connected graph G is called t-connected if it has more than t vertices and remains connected whenever fewer than t vertices are removed. We give a condition on the number of edges and a condition on the spectral radius for k-factor-criticality in t-connected graphs. (c) 2025 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.",

keywords = "Closure, Spectral radius, K-factor-critical graphs, T-connected",

author = "Tingyan Ma and \{van Dam\}, \{Edwin R.\} and Ligong Wang",

year = "2026",

month = mar,

day = "31",

doi = "10.1016/j.dam.2025.12.019",

language = "English",

volume = "382",

pages = "310--316",

journal = "Discrete Applied Mathematics",

issn = "0166-218X",

publisher = "Elsevier B.V.",

}

TY - JOUR

T1 - Spectral condition for k-factor-criticality in t-connected graphs

AU - Ma, Tingyan

AU - van Dam, Edwin R.

AU - Wang, Ligong

PY - 2026/3/31

Y1 - 2026/3/31

N2 - A graph G is called k-factor-critical if G - S has a perfect matching for every S subset of V(G) with |S| = k. A connected graph G is called t-connected if it has more than t vertices and remains connected whenever fewer than t vertices are removed. We give a condition on the number of edges and a condition on the spectral radius for k-factor-criticality in t-connected graphs. (c) 2025 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.

AB - A graph G is called k-factor-critical if G - S has a perfect matching for every S subset of V(G) with |S| = k. A connected graph G is called t-connected if it has more than t vertices and remains connected whenever fewer than t vertices are removed. We give a condition on the number of edges and a condition on the spectral radius for k-factor-criticality in t-connected graphs. (c) 2025 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.

KW - Closure

KW - Spectral radius

KW - K-factor-critical graphs

KW - T-connected

U2 - 10.1016/j.dam.2025.12.019

DO - 10.1016/j.dam.2025.12.019

M3 - Article

SN - 0166-218X

VL - 382

SP - 310

EP - 316

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

ER -

Spectral condition for<i> k</i>-factor-criticality in<i> t</i>-connected graphs

Abstract

Keywords

Access to Document

Embargoed Document

Fingerprint

Cite this