Back to Search
Start Over
A NEIGHBORHOOD UNION CONDITION FOR FRACTIONAL (k; n';m)-CRITICAL DELETED GRAPHS.
- Source :
-
Transactions on Combinatorics . 2017, Vol. 6 Issue 1, p13-19. 7p. - Publication Year :
- 2017
-
Abstract
- A graph G is called a fractional (k; n ' ;m)-critical deleted graph if any n ' vertices are removed from G the resulting graph is a fractional (k;m)-deleted graph. In this paper, we prove that for integers for each pair of non-adjacent vertices x, y of G, then G is a fractional (k; n ' ;m)-critical deleted graph. The bounds for neighborhood union condition, the order n and the minimum degree δ(G) of G are all sharp. [ABSTRACT FROM AUTHOR]
- Subjects :
- *GRAPH theory
*GEOMETRIC vertices
*INTEGERS
*COMBINATORICS
*MATHEMATICAL analysis
Subjects
Details
- Language :
- English
- ISSN :
- 22518657
- Volume :
- 6
- Issue :
- 1
- Database :
- Academic Search Index
- Journal :
- Transactions on Combinatorics
- Publication Type :
- Academic Journal
- Accession number :
- 120434280