Hostname: page-component-586b7cd67f-t7czq Total loading time: 0 Render date: 2024-11-24T08:31:02.296Z Has data issue: false hasContentIssue false
  • English
  • Français

A MINIMUM DEGREE CONDITION FOR FRACTIONAL ID-[a,b]-FACTOR-CRITICAL GRAPHS

Part of: Graph theory

Published online by Cambridge University Press:  07 February 2012

SIZHONG ZHOU ,
ZHIREN SUN  and
HONGXIA LIU
SIZHONG ZHOU*
Affiliation:
School of Mathematics and Physics, Jiangsu University of Science and Technology, Mengxi Road 2, Zhenjiang, Jiangsu 212003, PR China (email: [email protected])
ZHIREN SUN
Affiliation:
School of Computer Science, Nanjing Normal University, Nanjing, Jiangsu 210046, PR China
HONGXIA LIU
Affiliation:
School of Mathematics and Informational Science, Yantai University, Yantai, Shandong 264005, PR China
*
✉For correspondence; e-mail: [email protected]
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Let G be a graph of order n, and let a and b be two integers with 1≤a≤b. Let h:E(G)→[0,1] be a function. If a≤∑ e∋xh(e)≤b holds for any x∈V (G), then we call G[Fh] a fractional [a,b] -factor of G with indicator function h, where Fh ={e∈E(G):h(e)>0}. A graph G is fractional independent-set-deletable [a,b] -factor-critical (in short, fractional ID-[a,b] -factor-critical) if G−I has a fractional [a,b] -factor for every independent set I of G. In this paper, it is proved that if n≥((a+2b)(a+b−2)+1 )/b and δ(G)≥((a+b)n )/(a+2b ) , then G is fractional ID-[a,b] -factor-critical. This result is best possible in some sense, and it is an extension of Chang, Liu and Zhu’s previous result.

Keywords

graphminimum degreeindependent setfractional [a,b]-factorfractional ID-[a,b]-factor-critical graph

MSC classification

Secondary: 05C70: Factorization, matching, partitioning, covering and packing
Type
Research Article
Information
Bulletin of the Australian Mathematical Society , Volume 86 , Issue 2 , October 2012 , pp. 177 - 183
Copyright
Copyright © Australian Mathematical Publishing Association Inc. 2012

Footnotes

This research was supported by the Natural Science Foundation of the Higher Education Institutions of Jiangsu Province (10KJB110003), Jiangsu University of Science and Technology (2010SL101J) and Shandong Province Higher Educational Science and Technology Program (J10LA14), and was sponsored by the Qing Lan Project of Jiangsu Province.

References

[1]Bondy, J. A. and Murty, U. S. R., Graph Theory with Applications (The Macmillan Press, London, 1976).CrossRefGoogle Scholar
[2]Chang, R., Liu, G. and Zhu, Y., ‘Degree conditions of fractional ID-k-factor-critical graphs’, Bull. Malays. Math. Sci. Soc. (2) 33(3) (2010), 355–360.Google Scholar
[3]Li, Y. and Cai, M., ‘A degree condition for a graph to have [a,b]-factors’, J. Graph Theory 27 (1998), 1–6.3.0.CO;2-U>CrossRefGoogle Scholar
[4]Liu, G. and Zhang, L., ‘Fractional (g,f)-factors of graphs’, Acta Math. Sci. Ser. B 21(4) (2001), 541–545.CrossRefGoogle Scholar
[5]Liu, G. and Zhang, L., ‘Toughness and the existence of fractional k-factors of graphs’, Discrete Math. 308 (2008), 1741–1748.CrossRefGoogle Scholar
[6]Liu, G. and Zhang, L., ‘Characterizations of maximum fractional (g,f)-factors of graphs’, Discrete Appl. Math. 156 (2008), 2293–2299.CrossRefGoogle Scholar
[7]Lovasz, L. and Plummer, M. D., Matching Theory (Elsevier Science, North-Holland, 1986).Google Scholar
[8]Nam, Y., ‘Binding numbers and connected factors’, Graphs Combin. 26(6) (2010), 805–813.CrossRefGoogle Scholar
[9]Yuan, J., ‘Independent-set-deletable factor-critical power graphs’, Acta Math. Sci. Ser. B 26(4) (2006), 577–584.CrossRefGoogle Scholar
[10]Zhou, S., ‘Independence number, connectivity and (a,b,k)-critical graphs’, Discrete Math. 309(12) (2009), 4144–4148.CrossRefGoogle Scholar
[11]Zhou, S., ‘A minimum degree condition of fractional (k,m)-deleted graphs’, C. R. Math. 347(21–22) (2009), 1223–1226.Google Scholar
[12]Zhou, S., ‘A sufficient condition for a graph to be an (a,b,k)-critical graph’, Int. J. Comput. Math. 87(10) (2010), 2202–2211.CrossRefGoogle Scholar
[13]Zhou, S., ‘Binding numbers and [a,b]-factors excluding a given k-factor’, C. R. Math. 349(19–20) (2011), 1021–1024.Google Scholar
[14]Zhou, S., ‘A sufficient condition for graphs to be fractional (k,m)-deleted graphs’, Appl. Math. Lett. 24(9) (2011), 1533–1538.CrossRefGoogle Scholar
[15]Zhou, S., Bian, Q. and Xu, L., ‘Binding number and minimum degree for fractional (k,m)-deleted graphs’, Bull. Aust. Math. Soc. 85(1) (2012), 60–67.CrossRefGoogle Scholar