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 language | English |
---|---|
Article number | #P1.19 |
Journal | Electronic Journal of Combinatorics |
Volume | 24 |
Issue number | 1 |
DOIs | |
Publication status | Published - 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