What is the difference between the domination and independent domination numbers of a cubic graph?
From MaRDI portal
Publication:804588
DOI10.1007/BF01788145zbMath0728.05033OpenAlexW1979742759MaRDI QIDQ804588
Curtiss Barefoot, Kathryn Fraughnaugh Jones, Frank Harary
Publication date: 1991
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01788145
Related Items
A counterexample to conjecture of Barefoot, Harary, and Jones, Independent domination in hypercubes, Cubic graphs with large ratio of independent domination number to domination number, Disproof of a conjecture in the domination theory, Domination and irredundance in cubic graphs, Independent domination in subcubic graphs of girth at least six, Domination versus independent domination in cubic graphs, On the independent domination number of regular graphs, Domination versus independent domination in regular graphs, The independent domination number of a cubic 3-connected graph can be much larger than its domination number, Independent domination in bipartite cubic graphs, Inequalities relating domination parameters in cubic graphs, On independent domination in planar cubic graphs, On the differences between the upper irredundance, upper domination and independence numbers of a graph, Independent domination in signed graphs, An improved upper bound on the independent domination number in cubic graphs of girth at least six
Cites Work
