Cargando…
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 toughne...
| Autores principales: | , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Hindawi Publishing Corporation
2014
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4119723/ https://www.ncbi.nlm.nih.gov/pubmed/25114962 http://dx.doi.org/10.1155/2014/369798 |