Disjoint independent dominating sets in graphs
From MaRDI portal
Publication:1240740
DOI10.1016/0012-365X(76)90026-1zbMath0364.05035OpenAlexW1969466213MaRDI QIDQ1240740
E. J. Cockayne, Stephen T. Hedetniemi
Publication date: 1976
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(76)90026-1
Related Items (25)
Independent domination in directed graphs ⋮ On graphs admitting two disjoint maximum independent sets ⋮ Broadcasting in one dimension ⋮ Independent domination, colorings and the fractional idomatic number of a graph ⋮ On disjoint maximal independent sets in graphs ⋮ Disjoint cliques and disjoint maximal independent sets of vertices in graphs ⋮ On idomatic partitions of direct products of complete graphs ⋮ A structural approach for independent domination of regular graphs ⋮ GRAPHS THAT ARE NOT DOMATICALLY CO-CRITICAL ⋮ A theorem of Ore and self-stabilizing algorithms for disjoint minimal dominating sets ⋮ Two algorithms for determining a minimum independent dominating set ⋮ Idomatic partitions of direct products of complete graphs ⋮ FEW MORE RESULTS IN DOMATICALLY CO-CRITICAL GRAPHS ⋮ A counterexample to montgomery's conjecture on dynamic colourings of regular graphs ⋮ Disjoint cliques in regular graphs of degree seven and eight ⋮ On graph fall-coloring: existence and constructions ⋮ Coverings by minimal transversals ⋮ Common extremal graphs for three inequalities involving domination parameters ⋮ Fractional Domatic, Idomatic, and Total Domatic Numbers of a Graph ⋮ 1-well-covered graphs revisited ⋮ Dominating sets for split and bipartite graphs ⋮ Dominating sets and domatic number of circular arc graphs ⋮ Bibliography on domination in graphs and some basic definitions of domination parameters ⋮ Independent domination in signed graphs ⋮ Acyclic total dominating sets in cubic graphs
Cites Work
This page was built for publication: Disjoint independent dominating sets in graphs
