Name
Abstract | ||
|---|---|---|
The bondage number b(G) of a nonempty graph G is the cardinality of a minimum set of edges whose removal from G results in a graph with domination number greater than that of G. It is known that b(T)≤2 for any nontrivial tree T. In this paper, we obtain that the bondage number of the strong product of two nontrivial trees b(T⊠T′) is equal to b(T)b(T′) or b(T)b(T′)+1, which implies that b(T⊠T′) is equal to 1, 2, 3, 4 or 5. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1016/j.dam.2017.06.019 | Discrete Applied Mathematics |
Keywords | Field | DocType |
Bondage number,Strong product,Trees | Discrete mathematics,Graph,Combinatorics,Bondage number,Cardinality,Domination analysis,Mathematics | Journal |
Volume | ISSN | Citations |
230 | 0166-218X | 1 |
PageRank | References | Authors |
0.38 | 8 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Weisheng Zhao | 1 | 2 | 1.75 |
| Fan Wang | 2 | 1 | 0.72 |
| Xiaolu Gao | 3 | 1 | 0.38 |
| Hao Li | 4 | 261 | 85.92 |