Geodesic
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 University Press

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].
DOI : 10.1017/S0017089509990139
Mots-clés : 05C70 
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  - 
%0 Journal Article
%A ZHOU, SIZHONG
%T A NEIGHBOURHOOD CONDITION FOR GRAPHS TO BE FRACTIONAL (k, m)-DELETED GRAPHS*
%J Glasgow mathematical journal
%D 2010
%P 33-40
%V 52
%N 1
%U http://geodesic.mathdoc.fr/articles/10.1017/S0017089509990139/
%R 10.1017/S0017089509990139
%F 10_1017_S0017089509990139

[1] 1.Bondy, J. A. and Murty, U. S. R., Graph theory with applications (The Macmillan Press, London, 1976). Google Scholar | DOI

[2] 2.Correa, J. R. and Matamala, M., Some remarks about factors of graphs, J. Graph Theory 57 (2008), 265–274. Google Scholar | DOI

[3] 3.Iida, T. and Nishimura, T., Neighborhood conditions and k-factors, Tokyo J. Math. 20 (2) (1997), 411–418. Google Scholar | DOI

[4] 4.Liu, G. and Zhang, L., Fractional (g, f)-factors of graphs, Acta Math. Sci. 21B (4) (2001), 541–545. Google Scholar | DOI

[5] 5.Liu, G. and Zhang, L., Toughness and the existence of fractional k-factors of graphs, Discrete Math. 308 (2008), 1741–1748. Google Scholar | DOI

[6] 6.Scheinerman, E. R. and Ullman, D. H., Fractional graph theory (Wiley, New York, 1997). Google Scholar

[7] 7.Yu, J., Liu, G., Ma, M. and Cao, B., A degree condition for graphs to have fractional factors, Adv. Math. (China) 35 (5) (2006), 621–628. Google Scholar

[8] 8.Zhou, S., Some sufficient conditions for graphs to have (g, f)-factors, Bull. Aust. Math. Soc. 75 (2007), 447–452. Google Scholar | DOI

[9] 9.Zhou, S., A new sufficient condition for graphs to be (g, f, n)-critical graphs, Can. Math. Bull. (to appear). Google Scholar

[10] 10.Zhou, S., Remarks on (a, b, k)-critical graphs, J. Comb. Math. Comb. Comput. (to appear). Google Scholar

[11] 11.Zhou, S. and Liu, H., Neighborhood conditions and fractional k-factors, Bull. Malaysian Math. Sci. Soc. 32 (1) (2009), 37–45. Google Scholar

Cité par Sources :