Thumbnail Image
Item

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

Ma,Tingyan
; 
van Dam,Edwin R.
; 
Wang,Ligong
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.
Description
Date
2026-03-31
Journal Title
Journal ISSN
Volume Title
Publisher
Collections
Tilburg University Research Output Collection
Show all metadata
Files
1-s2.0-S0166218X25007267-main.pdf
Adobe PDF, 432.81 KB
Research Projects
Organizational Units
Journal Issue
Keywords
Closure, Spectral radius, K-factor-critical graphs, T-connected
Citation
Ma, T, van Dam, E R & Wang, L 2026, 'Spectral condition for <i > k </i >-factor-criticality in <i > t </i >-connected graphs', Discrete Applied Mathematics, vol. 382, pp. 310-316. https://doi.org/10.1016/j.dam.2025.12.019
URI
https://hdl.handle.net/20.500.14602/105518
License
info:eu-repo/semantics/embargoedAccess
cb
Embedded videos