Toughness Condition for a Graph to Be a Fractional (g,f,n)-Critical Deleted Graph
A graph G is called a fractional (g,f)-deleted graph if G-{e} admits a fractional (g,f)-factor for any e∈E(G). A graph G is called a fractional (g,f,n)-critical deleted graph if, after deleting any n vertices from G, the resulting graph is still a fractional (g,f)-deleted graph. The toughness, as th...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2014-01-01
|
| Series: | The Scientific World Journal |
| Online Access: | http://dx.doi.org/10.1155/2014/369798 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|