(Total) domination in prisms

Jernej Azarija, Michael A. Henning, Sandi Klavžar

Research output: Contribution to journalArticlepeer-review

14 Citations (Scopus)

Abstract

Using hypergraph transversals it is proved that γt(Qn+1) = 2γ(Qn), where γt(G) and γ(G) denote the total domination number and the domination number of G, respectively, and Qn is the n-dimensional hypercube. More generally, it is shown that if G is a bipartite graph, then (formula presented). Further, we show that the bipartiteness condition is essential by constructing, for any k ≥ 1, a (non-bipartite) graph G such that formula presented). Along the way several domination-type identities for hypercubes are also obtained.

Original languageEnglish
Article number#P1.19
JournalElectronic Journal of Combinatorics
Volume24
Issue number1
DOIs
Publication statusPublished - 3 Feb 2017

Keywords

  • Cartesian product of graphs
  • Covering codes
  • Domination
  • Hypercube
  • Hypergraph transversal
  • Total domination

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Geometry and Topology
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics
  • Applied Mathematics

Fingerprint

Dive into the research topics of '(Total) domination in prisms'. Together they form a unique fingerprint.

Cite this