An existence theorem on fractional ID-(g, f)-factor-critical covered graphs. Issue 1 (18th March 2022)

• Record Type: Journal Article
• Authors: Jiang, Jiashang
• Is Part Of: AKCE International Journal of Graphs and Combinatorics. Volume 19:Issue 1(2022)
• Page Start: 31
• Page End: 35
• Publication Date: 2022-03-18
• Subjects: Neighborhood of independent set -- minimum degree -- fractional (g -- f)-factor -- fractional (g -- f)-covered graph -- fractional ID-(g -- f)-factor-critical covered graph; 05C70
• DOI: 10.1080/09728600.2021.2010026
• Languages: English
• ISSNs: 0972-8600

Abstract

Abstract: A fractional ( g, f )-factor of a graph G is a function h that assigns to each edge of G a number in [0, 1] so that, for each vertex x of G we admit g ( x ) ≤ d G h ( x ) ≤ f ( x ), where d G h ( x ) = ∑ e ∋ x h ( e ) . A graph G is called a fractional ( g, f )-covered graph if for any e ∈ E ( G ), G admits a fractional ( g, f )-factor h satisfying h ( e ) = 1. A graph G is called a fractional ID-( g, f )-factor-critical covered graph if for any independent set I of G, G – I is a fractional ( g, f )-covered graph. In this paper, we present a neighborhood of independent set and minimum degree condition for a graph to be a fractional ID-( g, f )-factor-critical covered graph. Furthermore, we show that the main result is best possible in some sense.