Indexed by：
Abstract：
The bondage number b(G) of a nonempty graph G is the cardinality of a smallest set of edges whose removal from G results in a graph with domination number greater than γ(G), where γ(G) denote the domination number of G. Let G be a toroidal graph with maximum degree Δ(G). In this paper, we show that b(G) ≤ 9. Moveover, if Δ(G) ≠ 6, then b(G) ≤ 8. © 2012 World Scientific Publishing Company.
Keyword：
Reprint 's Address：
Email：
Source ：
Discrete Mathematics, Algorithms and Applications
ISSN： 1793-8309
Year： 2012
Issue： 3
Volume： 4
0 . 6 0 0
JCR@2023
Cited Count：
SCOPUS Cited Count： 4
ESI Highly Cited Papers on the List： 0 Unfold All
WanFang Cited Count：
Chinese Cited Count：
30 Days PV： 1
Affiliated Colleges：
