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!
|
| _version_ | 1832562715609006080 |
|---|---|
| author | Wei Gao Yun Gao |
| author_facet | Wei Gao Yun Gao |
| author_sort | Wei Gao |
| collection | DOAJ |
| description | 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 the parameter for measuring the vulnerability of communication networks, has received significant attention in computer science. In this paper, we present the relationship between toughness and fractional (g,f,n)-critical deleted graphs. It is determined that G is fractional (g,f,n)-critical deleted if t(G)≥((b2-1+bn)/a). |
| format | Article |
| id | doaj-art-0c2ce3ba9f1841a89ebd05a1c2eb57db |
| institution | Kabale University |
| issn | 2356-6140 1537-744X |
| language | English |
| publishDate | 2014-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | The Scientific World Journal |
| spelling | doaj-art-0c2ce3ba9f1841a89ebd05a1c2eb57db2025-02-03T01:21:51ZengWileyThe Scientific World Journal2356-61401537-744X2014-01-01201410.1155/2014/369798369798Toughness Condition for a Graph to Be a Fractional (g,f,n)-Critical Deleted GraphWei Gao0Yun Gao1School of Information Science and Technology, Yunnan Normal University, Kunming 650500, ChinaEditorial Department of Yunnan Normal University, Kunming 650092, ChinaA 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 the parameter for measuring the vulnerability of communication networks, has received significant attention in computer science. In this paper, we present the relationship between toughness and fractional (g,f,n)-critical deleted graphs. It is determined that G is fractional (g,f,n)-critical deleted if t(G)≥((b2-1+bn)/a).http://dx.doi.org/10.1155/2014/369798 |
| spellingShingle | Wei Gao Yun Gao Toughness Condition for a Graph to Be a Fractional (g,f,n)-Critical Deleted Graph The Scientific World Journal |
| title | Toughness Condition for a Graph to Be a Fractional (g,f,n)-Critical Deleted Graph |
| title_full | Toughness Condition for a Graph to Be a Fractional (g,f,n)-Critical Deleted Graph |
| title_fullStr | Toughness Condition for a Graph to Be a Fractional (g,f,n)-Critical Deleted Graph |
| title_full_unstemmed | Toughness Condition for a Graph to Be a Fractional (g,f,n)-Critical Deleted Graph |
| title_short | Toughness Condition for a Graph to Be a Fractional (g,f,n)-Critical Deleted Graph |
| title_sort | toughness condition for a graph to be a fractional g f n critical deleted graph |
| url | http://dx.doi.org/10.1155/2014/369798 |
| work_keys_str_mv | AT weigao toughnessconditionforagraphtobeafractionalgfncriticaldeletedgraph AT yungao toughnessconditionforagraphtobeafractionalgfncriticaldeletedgraph |