Back to matchesWe found a matchYour institution may have rights to this item. Sign in to continue.TitleIndependent Domination in Cubic Graphs.AuthorsDorbec, Paul; Henning, Michael A.; Montassier, Mickael; Southey, JustinAbstractA 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 of G, denoted bySubjectsGEOMETRIC vertices; GRAPH theory; PROPOSITIONAL calculus; BIPARTITE graphs; SUBGRAPHSPublicationJournal of Graph Theory, 2015, Vol 80, Issue 4, p329ISSN0364-9024Publication typeArticleDOI10.1002/jgt.21855