Total perfect codes in tensor products of graphs.

zbMATH Open1224.94058MaRDI QIDQ3070313FDOQ3070313

Authors: Ghidewon Abay Asmerom, Richard H. Hammack, Dewey T. Taylor 

Publication date: 2 February 2011

Recommendations

• Total perfect codes in grid graphs
• Total perfect codes in Cayley graphs
• scientific article; zbMATH DE number 5543260
• Perfect codes in some products of graphs
• An almost complete description of perfect codes in direct products of cycles

zbMATH Keywords

total perfect codetensor product of graphs

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Combinatorial codes (94B25)

Cited In (16)

• Subgroup total perfect codes in Cayley sum graphs
• Title not available (Why is that?)
• Some properties on the tensor product of graphs obtained by monogenic semigroups
• Total perfect codes in graphs realized by commutative rings
• Title not available (Why is that?)
• Some properties on the disjunctive product over graphs of monogenic semigroups
• Total perfect codes in Cayley graphs
• A Taxonomy of Perfect Domination
• Perfect codes in proper reduced power graphs of finite groups
• Perfect codes in circulant graphs
• Title not available (Why is that?)
• Total perfect codes, OO-irredundant and total subdivision in graphs
• Total perfect codes in grid graphs
• Perfect codes in power 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: Total perfect codes in tensor products of graphs.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3070313)