Bondage Number of 1-Planar Graph英文文献资料.docVIP

Applied Mathematics, 2010, 1, 101-103 doi:10.4236/am.2010.12013 Published Online July 2010 (http://www. SciRP.org/journal/am) Bondage Number of 1-Planar Graph* Qiaoling Ma, Sumei Zhang, Jihui Wang ? School of Science, University of Jinan, Jinan, China E-mail: wangjh@ Received May 8, 2010; revised June 1, 2010; accepted June 11, 2010 Abstract The bondage number b(G) of a nonempty graph G is the cardinality of a smallest set of edges whose re- moval from G results in a graph a domination number greater than the domination number of G. In this paper, we prove that b(G) ? 12 for a 1-planar graph G. Keywords: Domination Number, Bondage number, 1-Planar Graph, Combinatorial Problem 1. Introduction ?(G) ? 1. Conjecture 1.2 For any graph G, b(G) ? 3 ?(G) . Throughout this paper, we consider connected graphs without loops or multiple edges. A 1-planar graph is a graph which can be drawn on the plane so that every edge crosses at most one other edge. For a graph G, V (G) and E(G) are used to denote the vertex set and edge set of G, respectively. The degree of a vertex u in G is denoted by d(u) . For a vertex subset S ? V (G) , define N(S) ? {x V(G)\ S | there is a y ? S such that xy ? E(G) }. When S = {v}, we write N(v) ? N(S) for short. The minimum degree of vertices in G is denoted by ? (G) and the maximum degree by ?(G) . The distance between two vertices u and v in G is de- noted by d(u, v) . For a subset X ? V (G) , G[X ] denotes the subgraph of G induced by X. 2 In 2000, Kang and Yuan [3] proved that b(G) ? min ?8, ?(G) ? 2? for any planar graph. That is, conjecture 1.1 is showed for planar graph with ?(G) ? 7 . Up to now, conjecture 1.1 is still open for planar graph G with ?(G) ? 6 . Conjecture 1.2 is still open. In this paper, we prove that b(G) ? 12 for a 1-planar graph G. ? 2. Preliminary Results First of all, w