Partitioning the vertex set of $G$ to make $G\,\Box\, H$ an efficient open domination graph
From MaRDI portal
Publication:2965982
zbMath1400.05204arXiv1508.04029MaRDI QIDQ2965982
Douglas F. Rall, Iztok Peterin, Tadeja Kraner Šumenjak, Aleksandra Tepeh Horvat
Publication date: 3 March 2017
Full work available at URL: https://arxiv.org/abs/1508.04029
Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)
Related Items (3)
(Open) packing number of some graph products ⋮ Efficient closed domination in digraph products ⋮ Graphs that are simultaneously efficient open domination and efficient closed domination graphs
This page was built for publication: Partitioning the vertex set of $G$ to make $G\,\Box\, H$ an efficient open domination graph
