Perfect codes over graphs
From MaRDI portal
Publication:1057833
DOI10.1016/0095-8956(86)90079-1zbMath0563.94017OpenAlexW2051769825MaRDI QIDQ1057833
Publication date: 1986
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(86)90079-1
Related Items
Perfect codes and universal adjacency spectra of commuting graphs of finite groups ⋮ Cyclotomic graphs and perfect codes ⋮ The fullerene graphs with a perfect star packing ⋮ 1-perfect codes in Sierpiński graphs ⋮ Total perfect codes in Cayley graphs ⋮ Classification of efficient dominating sets of circulant graphs of degree 5 ⋮ An almost complete description of perfect codes in direct products of cycles ⋮ Subgroup regular sets in Cayley graphs ⋮ Weighted domination of cocomparability graphs ⋮ A general construction of strictly Neumaier graphs and a related switching ⋮ Characterizing subgroup perfect codes by 2-subgroups ⋮ Perfect codes in power graphs of finite groups ⋮ Efficient dominating sets in circulant graphs with domination number prime ⋮ On perfect codes in Cartesian products of graphs ⋮ Efficient dominating sets in Cayley graphs. ⋮ Perfect codes in vertex-transitive graphs ⋮ Perfect Codes in Cayley Graphs ⋮ Worst-case efficient dominating sets in digraphs ⋮ Regular sets in Cayley graphs ⋮ On efficiently total dominatable digraphs ⋮ Subgroup Perfect Codes in Cayley Graphs ⋮ Perfect codes in proper reduced power graphs of finite groups ⋮ On subgroup perfect codes in Cayley graphs ⋮ Perfect codes in direct products of cycles-a complete characterization ⋮ Efficient twin domination in generalized de Bruijn digraphs ⋮ On codes in the projective linear group \(\mathrm{PGL}(2,q)\) ⋮ A survey and classification of Sierpiński-type graphs ⋮ Graphs that are simultaneously efficient open domination and efficient closed domination graphs ⋮ Efficient absorbants in generalized de Bruijn digraphs ⋮ Efficient dominating sets in circulant graphs ⋮ Perfect codes in circulant graphs ⋮ Distribution of global defensive \(k\)-alliances over some graph products ⋮ Parameterized complexity of minimum membership dominating set ⋮ Smallest independent dominating sets in Kronecker products of cycles ⋮ Unnamed Item ⋮ The (non-)existence of perfect codes in Fibonacci cubes ⋮ Perfect codes in some products of graphs ⋮ Perfect \(r\)-domination in the Kronecker product of two cycles, with an application to diagonal/toroidal mesh ⋮ Characterization of subgroup perfect codes in Cayley graphs ⋮ On efficient absorbant conjecture in generalized De Bruijn digraphs ⋮ Perfect codes in Cayley sum graphs ⋮ Subgroup perfect codes in Cayley sum graphs ⋮ Perfect codes in direct graph bundles ⋮ Polynomial algorithms for the weighted perfect domination problems on chordal graphs and split graphs ⋮ Distance-regular graphs admitting a perfect 1-code ⋮ Optimal tristance anticodes in certain graphs
Cites Work
