A Neighborhood Condition for Fractional ID-[A, B]-Factor-Critical Graphs

• Autorzy: Sizhong Zhou , Fan Yang , Zhiren Sun
• Języki publikacji: EN

Abstrakty

EN

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∋x h(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 [...] for any two nonadjacent vertices x, y ∈ V (G), then G is fractional ID-[a, b]-factor-critical. Furthermore, it is shown that this result is best possible in some sense.

Słowa kluczowe

EN

graph; minimum degree; neighborhood; fractional [a; b]-factor; fractional ID-[a; b]-factor-critical graph

• Wydawca: De Gruyter Open
• Czasopismo: Discussiones Mathematicae Graph Theory
• Rocznik: 2016
• Tom: 36
• Numer: 2
• Strony: 409-418

Daty

wydano

2016-05-01

otrzymano

2015-02-12

zaakceptowano

2015-06-17

online

2016-04-15

Twórcy

autor

Sizhong Zhou

• School of Mathematics and Physics Jiangsu University of Science and Technology Mengxi Road 2, Zhenjiang, Jiangsu 212003, P.R. China

autor

Fan Yang

• School of Mathematics and Physics Jiangsu University of Science and Technology Mengxi Road 2, Zhenjiang, Jiangsu 212003, P.R. China

autor

Zhiren Sun

• School of Mathematical Sciences Nanjing Normal University Nanjing Jiangsu 210046, P.R. China

Identyfikatory

DOI

10.7151/dmgt.1864