The extension degree conditions for fractional factor (Q1987571)

From MaRDI portal
scientific article
Language Label Description Also known as
English
The extension degree conditions for fractional factor
scientific article

    Statements

    The extension degree conditions for fractional factor (English)
    0 references
    0 references
    0 references
    15 April 2020
    0 references
    Let \(h:E(G)\rightarrow[0,1]\) be a function. We write \(d_G^{h}(x)=\sum_{e\ni x}h(e)\). We call graph \(F_h\) with vertex set \(V(G)\) and edge set \(E_h\) a fractional \((g,f)\)-factor of \(G\) with indicator function \(h\) if \(g(x)\leq d_G^{h}(x)\leq f(x)\) holds for any \(x\in V(G)\), where \(E_h=\{e:e\in E(G),h(e)>0\}\). A graph \(G\) is called a fractional \((g,f,m)\)-deleted graph if there exists a fractional \((g,f)\)-factor \(F_h\) of \(G\) with indicator function \(h\) such that \(h(e)=0\) for any \(e\in E(H)\), where \(H\) is any subgraph of \(G\) with \(m\) edges. A graph \(G\) is called a fractional \((g,f,n^\prime,m)\)-critical deleted graph if after deleting any \(n^\prime\) vertices of \(G\), the remaining graph of \(G\) is a fractional \((g,f,m)\)-deleted graph. If \(G-I\) is a fractional \((g,f,m)\)-deleted graph for every independent set \(I\) of \(G\), then we say that \(G\) is fractional ID-\((g,f,m)\)-deleted. In this article, the authors explore the connection between the degree condition and fractional \((g,f,n^\prime,m)\)-critical deleted graph (rep. fractional ID-\((g,f,m)\)-deleted graph). They derive three degree conditions for graphs to be fractional \((g,f,n^\prime,m)\)-critical deleted, and present three degree conditions for graphs to be fractional ID-\((g,f,m)\)-deleted. Furthermore, the authors claim that the degree conditions in the above results are sharp. The above results are some generalizations of many previous results.
    0 references
    0 references
    fractional factor
    0 references
    degree condition
    0 references
    independent set
    0 references
    0 references
    0 references
    0 references