Domination and Independent Domination in Hexagonal Systems

A vertex subset D of G is a dominating set if every vertex in V ( G ) \ D is adjacent to a vertex in D . A dominating set D is independent if G [ D ] , the subgraph of G induced by D , contains no edge. The domination number γ ( G ) of a graph G is the minimum cardinality of a dominating set of G , and the independent domination number i ( G ) of G is the minimum cardinality of an independent dominating set of G . A classical work related to the relationship between γ ( G ) and i ( G ) of a graph G was established in 1978 by Allan and Laskar. They proved that every K 1 , 3 -free graph G satisfies γ ( G ) = i ( H ) . Hexagonal systems (2 connected planar graphs whose interior faces are all hexagons) have been extensively studied as they are used to present bezenoid hydrocarbon structures which play an important role in organic chemistry. The domination numbers of hexagonal systems have been studied continuously since 2018 when Hutchinson et al. posted conjectures, generated from a computer program called Conjecturing , related to the domination numbers of hexagonal systems. Very recently in 2021, Bermudo et al. answered all of these conjectures. In this paper, we extend these studies by considering the relationship between the domination number and the independent domination number of hexagonal systems. Although every hexagonal system H with at least two hexagons contains K 1 , 3 as an induced subgraph, we find many classes of hexagonal systems whose domination number is equal to an independent domination number. However, we establish the existence of a hexagonal system H such that γ ( H ) < i ( H ) with the prescribed number of hexagons.