scientific article; zbMATH DE number 5543260
From MaRDI portal
Publication:3620652
zbMATH Open1175.05048MaRDI QIDQ3620652FDOQ3620652
Authors: Ghidewon Abay Asmerom, Richard H. Hammack, Dewey T. Taylor 
Publication date: 14 April 2009
Title of this publication is not available (Why is that?)
Recommendations
- Perfect codes in some products of graphs
- Perfect \(r\)-codes in lexicographic products of graphs.
- On perfect codes in Cartesian products of graphs
- Total perfect codes in tensor products of graphs.
- Publication:4207865
- Publication:4892794
- Perfect codes in direct products of cycles-a complete characterization
- Perfect codes in circulant graphs
- Perfect codes in graphs
- Perfect codes over graphs
Distance in graphs (05C12) Graph operations (line graphs, products, etc.) (05C76) Combinatorial codes (94B25) Discrete location and assignment (90B80)
Cited In (12)
- Perfect \(r\)-codes in lexicographic products of graphs.
- 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
- An almost complete description of perfect codes in direct products of cycles
- 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
- Dominating sequences in grid-like and toroidal graphs
- Perfect codes and universal adjacency spectra of commuting graphs of finite groups
- Graphs that are simultaneously efficient open domination and efficient closed domination graphs
- Efficient closed domination in digraph products
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3620652)
