Article contents
A NEIGHBOURHOOD CONDITION FOR GRAPHS TO BE FRACTIONAL (k, m)-DELETED GRAPHS*
Published online by Cambridge University Press: 30 July 2009
Abstract
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].
Keywords
- Type
- Research Article
- Information
- Copyright
- Copyright © Glasgow Mathematical Journal Trust 2009
References
REFERENCES
- 5
- Cited by