scientific article
From MaRDI portal
Publication:2876034
zbMath1296.05148MaRDI QIDQ2876034
Mustapha Chellali, Alice A. McRae, Teresa W. Haynes, Stephen T. Hedetniemi, Odile Favaron
Publication date: 15 August 2014
Full work available at URL: http://ajc.maths.uq.edu.au/pdf/59/ajc_v59_p144.pdf
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (10)
Efficient location of resources in cylindrical networks ⋮ On independent \([1, 2\)-sets in trees] ⋮ Every grid has an independent \([1, 2\)-set] ⋮ A note on bipartite graphs whose [1,k-domination number equal to their number of vertices] ⋮ \([1,2\)-sets and \([1,2]\)-total sets in trees with algorithms] ⋮ \([1,k\)-domination number of lexicographic products of graphs] ⋮ Independent [1,2-domination of grids via min-plus algebra] ⋮ Efficient absorbants in generalized de Bruijn digraphs ⋮ An explicit construction of optimal dominating and [1, 2–dominating sets in grid] ⋮ On \([j, k\)-sets in graphs]
This page was built for publication:
