A neighborhood condition for fractional ID-[a,b]-factor-critical graphs

DOI10.7151/DMGT.1864MaRDI QIDQ274695zbMATH OpenOpenAlexFDO

Authors Fan Yang, Sizhong Zhou, Zhiren Sun

Publication date 25 April 2016

Published in Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

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

zbMATH Keywords

fractional \([a, b\)-factor]fractional ID-\([a, b\)-factor-critical graph]graphminimum degreeneighborhood

Mathematics Subject Classification ID

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

Abstract: Let $G$ be a graph of order $n$, and let $a$ and $b$ be two integers with $1leqaleqb$. Let $h:E(G)ightarrow[0,1]$ be a function. If $aleqsu{m}_{eix}h(e)leqb$ holds for any $xinV(G)$, then we call $G[F_h]$ a fractional $[a,b]$-factor of $G$ with indicator function $h$ where $F_h=einE(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 $ngeqfrac(a+2b)(2a+2b-3)+1b$, $delta(G)geqfracbna+2b+a$ and $|N_G(x)cup{N}_G(y)|geqfrac(a+b)na+2b$ for any two nonadjacent vertices $x,yinV(G)$, then $G$ is fractional ID-$[a,b]$-factor-critical. Furthermore, it is shown that this result is best possible in some sense.

Recommendations

• A degree condition for graphs to be fractional ID-\([a,b]\)-factor-critical
• A MINIMUM DEGREE CONDITION FOR FRACTIONAL ID-[a,b]-FACTOR-CRITICAL GRAPHS
• Neighbourhood conditions for fractional ID-\([a,b]\)-factor-critical graphs
• Neighborhood conditions for fractional ID-k-factor-critical graphs
• A neighborhood union condition for fractional ID-\([a, b]\)-factor-critical graphs

Cites work

• f-factors, complete-factors, and component-deleted subgraphs
• A MINIMUM DEGREE CONDITION FOR FRACTIONAL ID-[a,b]-FACTOR-CRITICAL GRAPHS
• A neighbourhood condition for graphs to have \([a,b]\)-factors
• A result on fractional ID-k-factor-critical graphs
• A sufficient condition for graphs to be fractional (k,m)-deleted graphs
• Binding numbers for fractional ID-\(k\)-factor-critical graphs
• Degree conditions of fractional ID-k-factor-critical graphs
• Fractional (g,f)-factors of graphs
• Independence number, connectivity and \((a,b,k)\)-critical graphs
• Neighborhood conditions and fractional \(k\)-factors
• Simplified existence theorems on all fractional \([a,b]\)-factors
• Stability number and [a,b]‐factors in graphs
• Star subdivisions and connected even factors in the square of a graph

Cited in

(15)

• 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
• Some existence theorems on all fractional (g,f)-factors with prescribed properties
• Neighborhood conditions for fractional ID-k-factor-critical graphs
• A toughness condition for fractional \((k, m)\)-deleted graphs revisited
• Tight independent set neighborhood union condition for fractional critical deleted graphs and ID deleted graphs
• A degree condition for graphs to be fractional ID-\([a,b]\)-factor-critical
• A result on fractional ID-\([a,b]\)-factor-critical graphs
• A MINIMUM DEGREE CONDITION FOR FRACTIONAL ID-[a,b]-FACTOR-CRITICAL GRAPHS
• A neighborhood condition for graphs to have restricted fractional (g,f)-factors
• Neighbourhood conditions for fractional ID-\([a,b]\)-factor-critical graphs
• An existence theorem on fractional ID-\((g, f)\)-factor-critical covered graphs
• Spectral radius, fractional $[a,b]$-factor and ID-factor-critical graphs
• Signless Laplacian spectral conditions for \(k\)-critical graphs with respect to \([1, b]\)-odd factors
• Spectral radius, the matching number and fractional criticality of graphs

This page was built for publication: A neighborhood condition for fractional ID-\([a,b]\)-factor-critical graphs

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