A note on the independent domination number versus the domination number in bipartite graphs
From MaRDI portal
Publication:5270987
DOI10.21136/CMJ.2017.0068-16zbMath1458.05208arXiv1606.05599MaRDI QIDQ5270987
Publication date: 3 July 2017
Published in: Czechoslovak Mathematical Journal (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1606.05599
Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (5)
Closed formulas for the independent (Roman) domination number of rooted product graphs ⋮ Hamilton-connectivity of interconnection networks modeled by a product of graphs ⋮ The domination complexity and related extremal values of large 3D torus ⋮ Independent domination in subcubic graphs ⋮ Global double Roman domination in graphs
This page was built for publication: A note on the independent domination number versus the domination number in bipartite graphs