Photo by timothycdykes from unsplash
A graph G is called a fractional ID-k-factor-critical graph if after deleting any independent set of G the resulting graph admits a fractional k-factor. In this paper, we prove that… Click to show full abstract
A graph G is called a fractional ID-k-factor-critical graph if after deleting any independent set of G the resulting graph admits a fractional k-factor. In this paper, we prove that for k 2, G is a fractional ID-k-factor-critical graph if ı.G/ n3 C k, 2.G/ 4n 3 , n 6k 8. The result is best possible in some sense. 2010 Mathematics Subject Classification: 05C70
Keywords:
factor;
condition fractional;
sum condition;
fractional factor;
factor critical;
degree sum
Journal Title: Miskolc Mathematical Notes
Year Published: 2017
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: Miskolc Mathematical Notes
Year Published: 2017
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!