PDF files of articles are only available for institutions which have paid for the online version upon signing an Institutional User License.

A tight neighborhood union condition on fractional $(g,f,n’,m)$-critical deleted graphs

Volume 149 / 2017

Wei Gao, Weifan Wang Colloquium Mathematicum 149 (2017), 291-298 MSC: Primary 05C70. DOI: 10.4064/cm6959-8-2016 Published online: 29 June 2017


A graph $G$ is called a fractional $(g,f,n’,m)$-critical deleted graph if it remains a fractional $(g,f,m)$-deleted graph after deleting any $n’$ vertices. We prove that if $G$ is a graph of order $n$, $1\le a\le g(x)\le f(x)\le b$ for any $x\in V(G)$, $\delta (G)\ge {b^{2}/a}+n’+2m$, $n \gt {((a+b)(2(a+b)+2m-1)+bn’)/a}$, and $|N_{G}(x_{1})\cup N_{G}(x_{2})|\ge {b(n+n’)/(a+b)}$ for any nonadjacent vertices $x_{1}$ an $x_{2}$, then $G$ is a fractional $(g,f,n’,m)$-critical deleted graph. The result is tight on the neighborhood union condition in some sense.


  • Wei GaoSchool of Information Science and Technology
    Yunnan Normal University
    Kunming 650500, China
  • Weifan WangDepartment of Mathematics
    Zhejiang Normal University
    Jinhua 321004, China

Search for IMPAN publications

Query phrase too short. Type at least 4 characters.

Rewrite code from the image

Reload image

Reload image