Perfect codes in direct graph bundles
From MaRDI portal
Publication:2346568
DOI10.1016/j.ipl.2015.03.010zbMath1370.94589OpenAlexW1987791461MaRDI QIDQ2346568
Janez Žerovnik, Irena Hrastnik Ladinek
Publication date: 2 June 2015
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2015.03.010
Related Items (2)
Graphs that are simultaneously efficient open domination and efficient closed domination graphs ⋮ The (non-)existence of perfect codes in Fibonacci cubes
Cites Work
- Unnamed Item
- Unnamed Item
- An almost complete description of perfect codes in direct products of cycles
- Perfect codes in direct products of cycles-a complete characterization
- Perfect \(r\)-domination in the Kronecker product of two cycles, with an application to diagonal/toroidal mesh
- Characterizing \(r\)-perfect codes in direct products of two and three cycles
- Perfect codes over graphs
- Perfect Code is \(W[1\)-complete]
- Edge-colorability of graph bundles
- Mixed fault diameter of Cartesian graph bundles
- Perfect codes in graphs
- The Kronecker Product of Graphs
- Perfect r-domination in the Kronecker product of three cycles
- Perfect Codes in the Lee Metric and the Packing of Polyominoes
This page was built for publication: Perfect codes in direct graph bundles