Perfect \(r\)-domination in the Kronecker product of two cycles, with an application to diagonal/toroidal mesh

DOI10.1016/S0020-0190(03)00268-0zbMath1161.68678MaRDI QIDQ1014414

Pranava K. Jha

Publication date: 28 April 2009

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

combinatorial problemsKronecker productCartesian producterror-correcting codesdiagonal meshperfect \(r\)-dominationtoroidal mesh

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (10)

An almost complete description of perfect codes in direct products of cycles ⋮ Orthogonal drawings and crossing numbers of the Kronecker product of two cycles ⋮ Perfect codes in direct products of cycles-a complete characterization ⋮ Cycle Kronecker products that are representable as optimal circulants ⋮ Quotients of Gaussian graphs and their application to perfect codes ⋮ Lower bounds for the domination number and the total domination number of direct product graphs ⋮ \([r,s,t\)-colorings of graph products] ⋮ Characterizing \(r\)-perfect codes in direct products of two and three cycles ⋮ Perfect codes in direct graph bundles ⋮ Perfect codes in direct products of cycles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A scheme to construct distance-three codes using Latin squares, with applications to the \(n\)-cube
• Perfect codes over graphs
• Kronecker products of paths and cycles: Decomposition, factorization and bi-pancyclicity
• Diagonal and toroidal mesh networks
• Perfect r-domination in the Kronecker product of three cycles
• The Categorical Product of Graphs
• Perfect Codes in the Lee Metric and the Packing of Polyominoes
• Smallest independent dominating sets in Kronecker products of cycles

This page was built for publication: Perfect \(r\)-domination in the Kronecker product of two cycles, with an application to diagonal/toroidal mesh