A result on fractional (a,b,k)-critical covered graphs

DOI10.1007/S10255-021-1034-8zbMATH Open1484.05175arXiv1912.12542OpenAlexW3206239925MaRDI QIDQ2240647FDOQ2240647

Authors: Sizhong Zhou 

Publication date: 4 November 2021

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Abstract: For a graph $G$, the set of vertices in $G$ is denoted by $V(G)$, and the set of edges in $G$ is denoted by $E(G)$. A fractional $[a,b]$-factor of a graph $G$ is a function $h$ from $E(G)$ to $[0,1]$ satisfying $aleq{d}_G^h(v)leqb$ for every vertex $v$ of $G$, where $d_G^h(v)=sumlimit{s}_{einE(v)}h(e)$ and $E(v)=e=uv:uinV(G)$. A graph $G$ is called fractional $[a,b]$-covered if $G$ contains a fractional $[a,b]$-factor $h$ with $h(e)=1$ for any edge $e$ of $G$. A graph $G$ is called fractional $(a,b,k)$-critical covered if $G-Q$ is fractional $[a,b]$-covered for any $QsubseteqV(G)$ with $|Q|=k$. In this article, we demonstrate a neighborhood condition for a graph to be fractional $(a,b,k)$-critical covered. Furthermore, we claim that the result is sharp.

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

Recommendations

• Discussion on fractional \((a, b, k)\)-critical covered graphs
• A neighborhood union condition for fractional \((a, b, k)\)-critical covered graphs
• Notes on fractional \((a, b, k)\)-critical covered graphs
• Independence number and connectivity for fractional \((a, b, k)\)-critical covered graphs
• A sufficient condition for fractional ID-\([a,b]\)-factor-critical covered graphs
• Degree conditions for fractional \((a,b,k)\)-critical covered graphs
• Binding numbers for fractional \((a, b, k)\)-critical covered graphs
• An existence theorem on fractional ID-\((g, f)\)-factor-critical covered graphs
• A degree condition for fractional \((g, f, n)\)-critical covered graphs
• Research on fractional critical covered graphs

zbMATH Keywords

fractional graph theorygraph factors

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Fractional graph theory, fuzzy graph theory (05C72)

Cites Work

• On factors with given components
• Title not available (Why is that?)
• A sufficient condition for a graph to have \([a,b]\)-factors
• Component factors and binding number conditions in graphs
• Remarks on path factors in graphs
• Subgraphs with orthogonal factorizations in graphs
• A neighborhood union condition for fractional ID-\([a, b]\)-factor-critical graphs
• Two tight independent set conditions for fractional \((g,f,m)\)-deleted graphs systems
• A note on degree sum conditions for 2-factors with a prescribed number of cycles in bipartite graphs
• A degree condition for fractional \([a,b]\)-covered graphs
• Degree conditions for fractional \((a,b,k)\)-critical covered graphs
• Neighbourhood and the existence of fractional \(k\)-factors of graphs
• Some results on path-factor critical avoidable graphs
• Research on fractional critical covered graphs
• A sufficient condition for the existence of restricted fractional \((g, f)\)-factors in graphs
• Binding numbers and restricted fractional \(( g , f )\)-factors in graphs
• A toughness condition for fractional \((k, m)\)-deleted graphs revisited
• A note on fractional ID-\( [ a , b ]\)-factor-critical covered graphs
• A neighborhood union condition for fractional \((a, b, k)\)-critical covered graphs
• Path factors in subgraphs
• Isolated toughness and path-factor uniform graphs
• On \(k\)-orthogonal factorizations in networks
• Brooks type results for conflict-free colorings and \(\{a, b \}\)-factors in graphs

Cited In (28)

• Remarks on restricted fractional \((g, f)\)-factors in graphs
• Path-factor critical covered graphs and path-factor uniform graphs
• A degree condition for fractional \((g, f, n)\)-critical covered graphs
• Neighborhood union conditions for fractional \([a, b]\)-covered graphs
• Degree conditions for fractional \((a,b,k)\)-critical covered graphs
• On fractional \((g, f, n^\prime, m)\)-critical covered graphs
• Some sufficient conditions for path-factor uniform graphs
• On \(P_{\geq 3}\)-factor deleted graphs
• Spectral radius conditions for fractional \([a,b]\)-covered graphs
• An existence theorem on fractional ID-\((g, f)\)-factor-critical covered graphs
• Discussion on fractional \((a, b, k)\)-critical covered graphs
• Discussions on orthogonal factorizations in digraphs
• Toughness for fractional \((2, b, k)\)-critical covered graphs
• Research on fractional critical covered graphs
• A Note of Generalization of Fractional ID-factor-critical Graphs
• Sun toughness and path-factor uniform graphs
• Path factors and neighborhoods of independent sets in graphs
• A note on fractional covers of a graph
• Two sufficient conditions for odd \([1,b]\)-factors in graphs
• Some results about star-factors in graphs
• Some properties on \(f\)-edge covered critical graphs
• A neighborhood condition for all fractional \((a,b,k)\)-critical graphs.
• On path-factor critical uniform graphs
• Isolated toughness and path-factor uniform graphs. II.
• A degree condition for fractional \([a,b]\)-covered graphs
• Notes on fractional \((a, b, k)\)-critical covered graphs
• A neighborhood union condition for fractional \((a, b, k)\)-critical covered graphs
• An improvement of the previous result on fractional \((a,b,k)\)-critical covered graphs

This page was built for publication: A result on fractional \((a,b,k)\)-critical covered graphs

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