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) denotes the domination number of G. Let G be a connected planar graph. In this paper, we shall show that if G is free of i-cycles for some i ε {3,4,5,6}, then b(G) ≤ 6.
Keyword：
Reprint 's Address：
Email：
Source ：
Utilitas Mathematica
ISSN： 0315-3681
Year： 2011
Volume： 84
Page： 189-199
0 . 1 3 7
JCR@2011
0 . 2 7 9
JCR@2020
JCR Journal Grade：4
CAS Journal Grade：4
Cited Count：
SCOPUS Cited Count：
ESI Highly Cited Papers on the List： 0 Unfold All
WanFang Cited Count：
Chinese Cited Count：
30 Days PV： 2
Affiliated Colleges：
