(Total) domination in prisms
From MaRDI portal
Publication:510330
zbMath1355.05181arXiv1606.08143MaRDI QIDQ510330
Jernej Azarija, Michael A. Henning, Sandi Klavžar
Publication date: 17 February 2017
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1606.08143
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)
Related Items (6)
On domination-type invariants of Fibonacci cubes and hypercubes ⋮ A note on domination and total domination in prisms ⋮ Packings in bipartite prisms and hypercubes ⋮ Domination in rose window graphs ⋮ Bounding the \(k\)-rainbow total domination number ⋮ Total domination in generalized prisms and a new domination invariant
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on total and paired domination of Cartesian product graphs
- Perfect domination sets in Cayley graphs
- Vizing's conjecture for graphs with domination number 3 -- a new proof
- On the total domination number of Cartesian products of graphs
- Independent domination in hypercubes
- Bounds for covering codes over large alphabets
- Independent perfect domination sets in Cayley graphs
- Vizing's conjecture: a survey and recent results
- Optimal binary covering codes of length 2j
- Partial product of graphs and Vizing's conjecture
- Hypergraphs with large transversal number and with edge sizes at least 3
- Improved sphere bounds on the covering radius of codes
- Dominating sets in n‐cubes
- Algorithms for Vertex Partitioning Problems on Partial k-Trees
- Paired-domination in graphs
- On the size of optimal binary codes of length 9 and covering radius 1
- An updated table of binary/ternary mixed covering codes
- Total Domination in Graphs
- On the Concentration of the Domination Number of the Random Graph
This page was built for publication: (Total) domination in prisms
