On Independent Domination in Planar Cubic Graphs

Open access


A set S of vertices in a graph G is an independent dominating set of G if S is an independent set and every vertex not in S is adjacent to a vertex in S. The independent domination number, i(G), of G is the minimum cardinality of an independent dominating set. Goddard and Henning [Discrete Math. 313 (2013) 839–854] posed the conjecture that if G ∉ {K3,3, C5K2} is a connected, cubic graph on n vertices, then i(G)38n, where C5K2 is the 5-prism. As an application of known result, we observe that this conjecture is true when G is 2-connected and planar, and we provide an infinite family of such graphs that achieve the bound. We conjecture that if G is a bipartite, planar, cubic graph of order n, then i(G)13n, and we provide an infinite family of such graphs that achieve this bound.

[1] C. Barefoot, F. Harary and K.F. Jones, What is the difference between the domi- nation and independent domination numbers of a cubic graph?, Graphs Combin. 7 (1991) 205–208. doi:10.1007/BF01788145

[2] P. Dorbec, M.A. Henning, M. Montassier and J. Southey, Independent domination in cubic graphs, J. Graph Theory 80 (2015) 329–349. doi:10.1002/jgt.21855

[3] W. Goddard and M.A. Henning, Independent domination in graphs: A survey and recent results, Discrete Math. 313 (2013) 839–854. doi:10.1016/j.disc.2012.11.031

[4] W. Goddard, M. A. Henning, J. Lyle and J. Southey, On the independent domination number of regular graphs, Ann. Comb. 16 (2012) 719–732. doi:10.1007/s00026-012-0155-4

[5] W. Goddard and J. Lyle, Independent dominating sets in triangle-free graphs, J. Comb. Optim. 23 (2012) 9–20. doi:10.1007/s10878-010-9336-4

[6] T.W. Haynes, S.T. Hedetniemi and P.J. Slater, Fundamentals of Domination in Graphs (Marcel Dekker, Inc. New York, 1998).

[7] M.A. Henning, C. Löwenstein and D. Rautenbach, Independent domination in sub- cubic bipartite graphs of girth at least six, Discrete Appl. Math. 162 (2014) 399–403. doi:10.1016/j.dam.2013.08.035

[8] A.V. Kostochka, The independent domination number of a cubic 3-connected graph can be much larger than its domination number, Graphs Combin. 9 (1993) 235–237. doi:10.1007/BF02988312

[9] P.C.B. Lam, W.C. Shiu and L. Sun, On independent domination number of regular graphs, Discrete Math. 202 (1999) 135–144. doi:10.1016/S0012-365X(98)00350-1

[10] J. Lyle, A note on independent sets in graphs with large minimum degree and small cliques, Electron. J. Combin. 21 (2014) #P2.38.

[11] O. Ore, Theory of graphs, Amer. Math. Soc. Transl. 38 (1962) 206–212. doi:10.1090/coll/038

[12] J. Southey and M.A. Henning, Domination versus independent domination in cubic graphs, Discrete Math. 313 (2013) 1212–1220. doi:10.1016/j.disc.2012.01.003

[13] T. Zhu and B. Wu, Domination of maximal K4-minor free graphs and maximal K2,3-minor free graphs, and disproofs of two conjectures on planar graphs, Discrete Appl. Math. 194 (2015) 147–153. doi:10.1016/j.dam.2015.05.029

Discussiones Mathematicae Graph Theory

The Journal of University of Zielona Góra

Journal Information

IMPACT FACTOR 2018: 0.741
5-year IMPACT FACTOR: 0.611

CiteScore 2018: 0.73

SCImago Journal Rank (SJR) 2018: 0.763
Source Normalized Impact per Paper (SNIP) 2018: 0.934

Mathematical Citation Quotient (MCQ) 2017: 0.36

Target Group

researchers in the fields of: colourings, partitions (general colourings), hereditary properties, independence and dominating structures (sets, paths, cycles, etc.), cycles, local properties, products of graphs


All Time Past Year Past 30 Days
Abstract Views 0 0 0
Full Text Views 57 57 36
PDF Downloads 32 32 15