scientific article
From MaRDI portal
Publication:4029974
zbMath0766.05040MaRDI QIDQ4029974
Michael A. Henning, Henda C. Swart, Ortrud R. Oellermann
Publication date: 1 April 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (23)
Distributed distance domination in graphs with no \(K_{2,t}\)-minor ⋮ The ratio of the distance irredundance and domination numbers of a graph ⋮ The diversity of domination ⋮ Unnamed Item ⋮ An efficient algorithm to solve the distancek-domination problem on permutation graphs ⋮ Distance irredundance and connected domination numbers of a graph ⋮ Approximating the Spanning k-Tree Forest Problem ⋮ An algorithm to find two distance domination parameters in a graph ⋮ Distance domination in graphs with given minimum and maximum degree ⋮ A linear time algorithm for optimal \(k\)-hop dominating set of a tree ⋮ Unnamed Item ⋮ On bondage numbers of graphs: a survey with some comments ⋮ On connected \(k\)-domination numbers of graphs. ⋮ \(k\)-domination and \(k\)-independence in graphs: A survey ⋮ Some new results on distance \(k\)-domination in graphs ⋮ Total $k$-distance domination critical graphs ⋮ Some variations of perfect graphs ⋮ An efficient algorithm for distance total domination in block graphs ⋮ Distance Domination in Graphs ⋮ Strong non split r-domination number of a graph ⋮ Packing in trees ⋮ Mim-width. III. Graph powers and generalized distance domination problems ⋮ On the Universality of Small-World Graphs
This page was built for publication:
