Isolated toughness and fractional (a,b,n)-critical graphs

Isolated toughness and fractional (a,b,n)-critical graphs

A graph G is a fractional $ (a,b,n) $ -critical graph if removing any n vertices from G, the resulting subgraph still admits a fractional $ [a,b] $ -factor. In this paper, we determine the exact tight isolated toughness bound for fractional $ (a,b,n) $ -critical graphs. To be specific, a graph G is...

Full description

Saved in:
Bibliographic Details
Main Authors: Wei Gao, Weifan Wang, Yaojun Chen
Format: Article
Language:English
Published: Taylor & Francis Group 2023-12-01
Series:Connection Science
Subjects:
graph
isolated toughness
fractional $ [a, b] $ -factor
fractional $ (a,b,n) $ -critical graph
Online Access:http://dx.doi.org/10.1080/09540091.2023.2181482
Tags: Add Tag
No Tags, Be the first to tag this record!

Internet

http://dx.doi.org/10.1080/09540091.2023.2181482

Similar Items