A NEIGHBOURHOOD CONDITION FOR GRAPHS TO BE FRACTIONAL (k, m)-DELETED GRAPHS*
Glasgow mathematical journal, Tome 52 (2010) no. 1, pp. 33-40
Voir la notice de l'article provenant de la source Cambridge
Let G be a connected graph of order n, and let k ≥ 2 and m ≥ 0 be two integers. In this paper, we show that G is a fractional (k, m)-deleted graph if and for each pair of non-adjacent vertices x, y of G. This result is an extension of the previous result of Zhou [11].
ZHOU, SIZHONG. A NEIGHBOURHOOD CONDITION FOR GRAPHS TO BE FRACTIONAL (k, m)-DELETED GRAPHS*. Glasgow mathematical journal, Tome 52 (2010) no. 1, pp. 33-40. doi: 10.1017/S0017089509990139
@article{10_1017_S0017089509990139,
author = {ZHOU, SIZHONG},
title = {A {NEIGHBOURHOOD} {CONDITION} {FOR} {GRAPHS} {TO} {BE} {FRACTIONAL} (k, {m)-DELETED} {GRAPHS*}},
journal = {Glasgow mathematical journal},
pages = {33--40},
year = {2010},
volume = {52},
number = {1},
doi = {10.1017/S0017089509990139},
url = {http://geodesic.mathdoc.fr/articles/10.1017/S0017089509990139/}
}
TY - JOUR AU - ZHOU, SIZHONG TI - A NEIGHBOURHOOD CONDITION FOR GRAPHS TO BE FRACTIONAL (k, m)-DELETED GRAPHS* JO - Glasgow mathematical journal PY - 2010 SP - 33 EP - 40 VL - 52 IS - 1 UR - http://geodesic.mathdoc.fr/articles/10.1017/S0017089509990139/ DO - 10.1017/S0017089509990139 ID - 10_1017_S0017089509990139 ER -
Cité par Sources :