A graph G is called a fractional (g, f)-covered graph if for any e ∈ E(G), G admits a fractional (g, f)-factor covering e. A graph G is called a fractional (g, f, n)-critical covered graph if for any S ⊆ V(G) with ∣S∣ = n, G − S is a fractional (g, f)-covered graph. A fractional (g, f, n)-critical covered graph is said to be a fractional (a, b, n)-critical covered graph if g(x) = a and f(x) = b for every x ∈ V(G). A fractional (a, b, n)-critical covered graph was first defined and studied in [1]. In this article, we investigate fractional (g, f, n)-critical covered graphs and present a binding number condition for the existence of fractional (g, f, n)-critical covered graphs, which is an improvement and generalization of a previous result obtained in [2].

一个图ģ被称为分数（克，  ˚F） -覆盖曲线图，如果对任意Ë  ∈  È（ģ），G ^承认分数（克，  ˚F） -因子覆盖Ë。一个图ģ被称为分数（克，  ˚F，  Ñ） -临界覆盖图，如果对任意小号 ⊆  V（G ^）与|小号| =  Ñ，g ^  - 小号是分数（克，  ˚F）覆盖的图形。小数（克，  ˚F，  Ñ） -临界覆盖图被说成是一个分数（一个，  b，  Ñ） -临界覆盖图若克（X）= 一个和˚F（X）=  b为每个X  ∈  V（G）。分数（a，  b，  n）临界覆盖图首先在[1]中定义和研究。在本文中，我们研究小数（g，  f，  n临界覆盖图，并给出了分数（g，  f，  n）临界覆盖图的存在的绑定数条件，这是对[2]中获得的先前结果的改进和推广。