The extension degree conditions for fractional factor

DOI10.1007/S10114-020-9156-0MaRDI QIDQ1987571zbMATH OpenOpenAlexFDO

Authors Wei Gao, Weifan Wang, Juan L. G. Guirao

Publication date 15 April 2020

Published in Acta Mathematica Sinica, English Series (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1904.02482

zbMATH Keywords

degree conditionfractional factorindependent set

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Abstract: In Gao's previous work, the authors determined several graph degree conditions of a graph which admits fractional factor in particular settings. It was revealed that these degree conditions are tight if $b=f(x)=g(x)=a$ for all vertices $x$ in $G$. In this paper, we continue to discuss these degree conditions for admitting fractional factor in the setting that several vertices and edges are removed and there is a difference $Delta$ between $g(x)$ and $f(x)$ for every vertex $x$ in $G$. These obtained new degree conditions reformulate Gao's previous conclusions, and show how $Delta$ acts in the results. Furthermore, counterexamples are structured to reveal the sharpness of degree conditions in the setting $f(x)=g(x)+Delta$.

Review text

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.

Recommendations

• scientific article; zbMATH DE number 37760
• Neighborhood conditions for the existence of fractional k-factors with prescribed properties
• Neighborhood conditions and fractional \(k\)-factors
• Degree conditions and fractional k-factors of graphs
• Degree conditions for 2-factors
• The half-factorial property in integral extensions
• scientific article; zbMATH DE number 2111180
• Nash-Williams conditions for the existence of all fractional \([a,b]\)-factors
• scientific article; zbMATH DE number 969172
• scientific article; zbMATH DE number 3561943

Cites work

• A result on r-orthogonal factorizations in digraphs
• An existence theorem on fractional deleted graphs
• An independent set degree condition for fractional critical deleted graphs
• Convexity result and trees with large Balaban index
• Degree conditions for fractional (g,f,n^,m)-critical deleted graphs and fractional ID-(g,n,f,m)-deleted graphs
• Graph theory
• Hamilton-connectivity of interconnection networks modeled by a product of graphs
• scientific article; zbMATH DE number 1111349 (Why is no real title available?)
• scientific article; zbMATH DE number 6606170 (Why is no real title available?)
• Neighborhood conditions for fractional ID-k-factor-critical graphs
• Remarks on fractional ID-\(k\)-factor-critical graphs
• Remarks on orthogonal factorizations of digraphs
• Some existence theorems on all fractional (g,f)-factors with prescribed properties
• Some results about component factors in graphs
• Tight independent set neighborhood union condition for fractional critical deleted graphs and ID deleted graphs
• Two tight independent set conditions for fractional (g,f,m)-deleted graphs systems

Cited in

(14)

• Two tight independent set conditions for fractional (g,f,m)-deleted graphs systems
• Isolated toughness and \(k\)-Hamiltonian \([a,b]\)-factors
• Degree conditions for \(k\)-Hamiltonian \([a,b]\)-factors
• Sun toughness conditions for \(P_2\) and \(P_3\) factor uniform and factor critical avoidable graphs
• Discussion on fractional (a, b, k)-critical covered graphs
• A note on fractional ID-\( [ a , b ]\)-factor-critical covered graphs
• Research on fractional critical covered graphs
• An independent set degree condition for fractional critical deleted graphs
• An existence theorem on fractional deleted graphs
• An extension result on fractional ID-(g,f,m)-deleted graph.
• Some results about ID-path-factor critical graphs
• Forbidden restrictions and the existence of \(P_{\geq 2}\)-factor and \(P_{\geq 3}\)-factor
• On fractional (g, f, n^, m)-critical covered graphs
• Degree conditions for fractional (g,f,n^,m)-critical deleted graphs and fractional ID-(g,n,f,m)-deleted graphs

This page was built for publication: The extension degree conditions for fractional factor

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1987571)