An almost complete description of perfect codes in direct products of cycles
From MaRDI portal
Publication:864867
DOI10.1016/J.AAM.2005.10.002zbMATH Open1114.05073OpenAlexW2056105229MaRDI QIDQ864867FDOQ864867
Authors: Sandi Klavžar, Simon Špacapan, Janez Žerovnik 
Publication date: 13 February 2007
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.aam.2005.10.002
Recommendations
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Other types of codes (94B60)
Cites Work
- 1-perfect codes in Sierpiński graphs
- Title not available (Why is that?)
- Perfect codes in graphs
- Title not available (Why is that?)
- Factoring cardinal product graphs in polynomial time
- The Kronecker Product of Graphs
- Title not available (Why is that?)
- Perfect codes over graphs
- Perfect codes in direct products of cycles
- Title not available (Why is that?)
- Regular codes in regular graphs are difficult
- Error-correcting codes on the Towers of Hanoi graphs
- Perfect \(r\)-domination in the Kronecker product of two cycles, with an application to diagonal/toroidal mesh
- Isomorphic components of Kronecker product of bipartite graphs
- Diagonal and toroidal mesh networks
- Perfect r-domination in the Kronecker product of three cycles
- Characterizing \(r\)-perfect codes in direct products of two and three cycles
- Title not available (Why is that?)
Cited In (21)
- Perfect codes in Cartesian products of hypercube and multidimensional grid
- Perfect codes in Cartesian products of 2-paths and infinite paths
- Perfect \(r\)-codes in lexicographic products of graphs.
- Optimal Lee-Type Local Structures in Cartesian Products of Cycles and Paths
- Efficient absorbants in generalized de Bruijn digraphs
- On efficient absorbant conjecture in generalized de Bruijn digraphs
- Perfect codes in direct graph bundles
- Characterizing \(r\)-perfect codes in direct products of two and three cycles
- Total perfect codes in tensor products of graphs.
- The (non-)existence of perfect codes in Fibonacci cubes
- A Taxonomy of Perfect Domination
- Lower bounds for the domination number and the total domination number of direct product graphs
- Efficient domination in cubic vertex-transitive graphs
- Perfect codes in circulant graphs
- On perfect codes in Cartesian products of graphs
- Perfect codes in some products of graphs
- Perfect codes in direct products of cycles-a complete characterization
- Cyclotomic graphs and perfect codes
- Dominating sequences in grid-like and toroidal graphs
- Graphs that are simultaneously efficient open domination and efficient closed domination graphs
- Efficient closed domination in digraph products
This page was built for publication: An almost complete description of perfect codes in direct products of cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q864867)
