Hostname: page-component-7b7567c8c-w7t8q Total loading time: 0 Render date: 2026-11-18T14:01:41.452Z Has data issue: false hasContentIssue false

A SUFFICIENT CONDITION FOR A GRAPH TO BE A FRACTIONAL (f, n)-CRITICAL GRAPH

Published online by Cambridge University Press:  29 March 2010

SIZHONG ZHOU*
Affiliation:
School of Mathematics and Physics, Jiangsu University of Science and Technology, Mengxi Road 2, Zhenjiang, Jiangsu 212003, People's Republic of China e-mail: zsz_cumt@163.com
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 a, b and n be non-negative integers such that 1 ≤ a ≤ b, and let G be a graph of order p with $\(p\geq\frac{(a+b-1)(a+b-2)+bn-2}{a}\)$ and f be an integer-valued function defined on V(G) such that a ≤ f(x) ≤ b for all x ∈ V(G). Let h: E(G) → [0, 1] be a function. If ∑e∋xh(e) = f(x) holds for any x ∈ V(G), then we call G[Fh] a fractional f-factor of G with indicator function h, where Fh = {e ∈ E(G): h(e) > 0}. A graph G is called a fractional (f, n)-critical graph if after deleting any n vertices of G the remaining graph of G has a fractional f-factor. In this paper, it is proved that G is a fractional (f, n)-critical graph if $\(|N_G(X)|>\frac{(b-1)p+|X|+bn-1}{a+b-1}\)$ for every non-empty independent subset X of V(G), and $\(\delta(G)>\frac{(b-1)p+a+b+bn-2}{a+b-1}\)$. Furthermore, it is shown that the result in this paper is best possible in some sense.

Keywords

Information

Type
Research Article
Copyright
Copyright © Glasgow Mathematical Journal Trust 2010