INDEPENDENCE NUMBER AND CONNECTIVITY FOR FRACTIONAL ID-[ a, b ]-FACTOR-CRITICAL GRAPHS

A graph G is fractional ID-[a, b]-factor-critical if G - I includes a fractional [a, b]factor for every independent set I of G. In this paper, it is proved that if k(G) ≥ max{ ... }, then q is fractional ID-[a, b]-factor-critical.

Saved in:
Bibliographic Details
Published inPacific journal of applied mathematics Vol. 9; no. 4; pp. 309 - 313
Main Authors Liang, Caixia, Lin, Liyun
Format Journal Article
LanguageEnglish
Published Hauppauge Nova Science Publishers, Inc 01.10.2017
Subjects
Applied mathematics
Graphs
Numbers
Online AccessGet full text
ISSN1941-3963

Cover

More Information
Summary:A graph G is fractional ID-[a, b]-factor-critical if G - I includes a fractional [a, b]factor for every independent set I of G. In this paper, it is proved that if k(G) ≥ max{ ... }, then q is fractional ID-[a, b]-factor-critical.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1941-3963