Partitioning the vertex set of G to make G H an efficient open domination graph

MaRDI QIDQ2965982zbMATHFDO

Authors Tadeja Kraner Šumenjak, Iztok Peterin, Douglas F. Rall, Aleksandra Tepeh

Publication date 3 March 2017

Full work available at URL https://arxiv.org/abs/1508.04029

zbMATH Keywords

total dominationCartesian productvertex labelingefficient open domination

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Abstract: A graph is an efficient open domination graph if there exists a subset of vertices whose open neighborhoods partition its vertex set. We characterize those graphs $G$ for which the Cartesian product $GBoxH$ is an efficient open domination graph when $H$ is a complete graph of order at least 3 or a complete bipartite graph. The characterization is based on the existence of a certain type of weak partition of $V(G)$. For the class of trees when $H$ is complete of order at least 3, the characterization is constructive. In addition, a special type of efficient open domination graph is characterized among Cartesian products $GBoxH$ when $H$ is a 5-cycle or a 4-cycle.

Recommendations

• scientific article; zbMATH DE number 5080622
• Efficient closed domination in digraph products
• Efficient open domination in Cayley graphs
• Graphs that are simultaneously efficient open domination and efficient closed domination graphs

Cited in

(3)

• Efficient closed domination in digraph products
• (Open) packing number of some graph 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\square H\) an efficient open domination graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2965982)