On independent domination number of regular graphs
From MaRDI portal
Publication:1301709
DOI10.1016/S0012-365X(98)00350-1zbMath0934.05098OpenAlexW2127967904MaRDI QIDQ1301709
Liang Sun, Wai Chee Shiu, Peter Che Bor Lam
Publication date: 10 April 2000
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(98)00350-1
Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (23)
Cubic graphs with large ratio of independent domination number to domination number ⋮ Minimum maximal matchings in cubic graphs ⋮ Bounds on domination parameters in graphs: a brief survey ⋮ Independent Domination in Cubic Graphs ⋮ Independent dominating sets in regular graphs ⋮ Independent domination in subcubic graphs of girth at least six ⋮ Domination versus independent domination in cubic graphs ⋮ Domination versus independent domination in graphs of small regularity ⋮ On the independent domination number of regular graphs ⋮ On independent domination of regular graphs ⋮ A tight bound for independent domination of cubic graphs without 4‐cycles ⋮ Independent domination in triangle-free graphs ⋮ Upper bounds for independent domination in regular graphs ⋮ Independent domination number in Cayley digraphs of rectangular groups ⋮ A structural approach for independent domination of regular graphs ⋮ Independent sets in graphs ⋮ Independent domination in bipartite cubic graphs ⋮ A note on the independent domination number of subset graph ⋮ Independent domination in subcubic bipartite graphs of girth at least six ⋮ On independent domination in planar cubic graphs ⋮ Independent domination in subcubic graphs ⋮ My Favorite Domination Conjectures in Graph Theory Are Bounded ⋮ An improved upper bound on the independent domination number in cubic graphs of girth at least six
Cites Work
- Bibliography on domination in graphs and some basic definitions of domination parameters
- Two relations between the parameters of independence and irredundance
- Contributions to the theory of domination, independence and irredundance in graphs
- The product of the independent domination numbers of a graph and its complement
- On minimum maximal independent sets of a graph
- On a Nordhaus-Gaddum type problem for independent domination
- Independent domination in regular graphs
- Graph-theoretic parameters concerning domination, independence, and irredundance
- Unnamed Item
This page was built for publication: On independent domination number of regular graphs
