Perfect codes in graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1553627 (Why is no real title available?)
- scientific article; zbMATH DE number 3445271 (Why is no real title available?)
- scientific article; zbMATH DE number 3349863 (Why is no real title available?)
- On Trivalent Graphs
- On the Nonexistence of Perfect Codes over Finite Fields
- Two theorems on perfect codes
Cited in
(only showing first 100 items - show all)- Dominating induced matchings in \(S_{1 , 2 , 4}\)-free graphs
- A note on the open packing number in graphs
- Perfect codes in Euclidean lattices
- Perfect codes in the discrete simplex
- Lloyd's theorem for perfect codes
- Efficient dominating sets in circulant graphs with domination number prime
- Perfect codes in Cartesian products of hypercube and multidimensional grid
- Mim-width. III. Graph powers and generalized distance domination problems
- On the efficiency index of a graph
- Total Roman domination in the lexicographic product of graphs
- Generalized distance domination problems and their complexity on graphs of bounded mim-width
- A survey and classification of Sierpiński-type graphs
- Efficient \((j, k)\)-dominating functions
- Efficient location of resources in cylindrical networks
- On efficient domination for some classes of H-free bipartite graphs
- Perfect codes and independent dominating sets
- Quotients of Gaussian graphs and their application to perfect codes
- Optimal tristance anticodes in certain graphs
- Weighted efficient domination for some classes of H-free and of (H₁, H₂)-free graphs
- Perfect codes in direct products of cycles
- Extremal problems related to the cardinality-redundance of graphs
- Weighted domination of cocomparability graphs
- Subgroup perfect codes of 2-groups with cyclic maximal subgroups
- Regular codes in regular graphs are difficult
- Stopping sets of codes from complete graph
- Efficient domination in Cayley graphs of generalized dihedral groups
- Perfect codes in the graphs Ok and L(Ok)
- Efficient absorbants in generalized de Bruijn digraphs
- Worst-case efficient dominating sets in digraphs
- Perfect codes in Doob graphs
- Extended formulations for perfect domination problems and their algorithmic implications
- On non-normal subgroup perfect codes
- Weighted efficient domination for P₆-free and for P₅-free graphs
- The (non-)existence of perfect codes in Lucas cubes
- Perfect codes in direct graph bundles
- Total perfect codes in graphs realized by commutative rings
- The fullerene graphs with a perfect star packing
- scientific article; zbMATH DE number 4130438 (Why is no real title available?)
- scientific article; zbMATH DE number 4134101 (Why is no real title available?)
- A dichotomy for weighted efficient dominating sets with bounded degree vertices
- Efficient domination through eigenvalues
- Kernelization of edge perfect code and its variants
- Fundamentals of coding type problems
- Perfect codes in m-Cayley hypergraphs
- On perfect codes and related concepts
- Perfect codes in Cayley graphs of abelian groups
- Rainbow perfect domination in lattice graphs
- On efficient domination for some classes of \(H\)-free chordal graphs
- The (non-)existence of perfect codes in Fibonacci cubes
- scientific article; zbMATH DE number 4128763 (Why is no real title available?)
- Subgroup Perfect Codes in Cayley Graphs
- On graph-based codes over Ramanujan graphs: existence and design of infinite families
- scientific article; zbMATH DE number 921905 (Why is no real title available?)
- Quasiperfect domination in trees
- Graphs with unique maximum packing of closed neighborhoods
- Total perfect codes in Cayley graphs
- A Lloyd theorem in weakly metric association schemes
- An almost complete description of perfect codes in direct products of cycles
- PERFECT CODES ON SOME ORDERED SETS
- Efficient domination in cubic vertex-transitive graphs
- Parameterized complexity of minimum membership dominating set
- On subgroup perfect codes in Cayley sum graphs
- Perfect codes in circulant graphs
- A Taxonomy of Perfect Domination
- Finding dominating induced matchings in P₉-free graphs in polynomial time
- Finding dominating induced matchings in \(S_{2, 2, 3}\)-free graphs in polynomial time
- scientific article; zbMATH DE number 3871186 (Why is no real title available?)
- On codes in the projective linear group \(\mathrm{PGL}(2,q)\)
- On perfect codes in Cartesian products of graphs
- Nearly perfect codes in distance-regular graphs
- A general construction of strictly Neumaier graphs and a related switching
- Tight 2-designs and perfect 1-codes in Doob graphs
- scientific article; zbMATH DE number 3922532 (Why is no real title available?)
- scientific article; zbMATH DE number 4164736 (Why is no real title available?)
- Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs
- Proof of a conjecture of Green and Liebeck on codes in symmetric groups
- Subgroup regular sets in Cayley graphs
- Polynomial-time algorithm for weighted efficient domination problem on diameter three planar graphs
- On regular sets in Cayley sum graphs
- On the parameters of codes for the Lee and modular distance
- On efficient domination for some classes of \(H\)-free chordal graphs
- Perfect codes in direct products of cycles-a complete characterization
- Minimum-membership geometric dominating set: complexity and algorithms
- Finding dominating induced matchings in \(P_{10}\)-free graphs in polynomial time
- Neighbour-transitive codes in Kneser graphs
- Subgroup (total) perfect codes of generalized Cayley graphs
- Efficient edge domination problems in graphs
- Efficient twin domination in generalized de Bruijn digraphs
- Weighted efficient domination problem on some perfect graphs
- Perfect codes over graphs
- Distance-regular graphs admitting a perfect 1-code
- Modelling and solving the perfect edge domination problem
- The existence of perfect codes in a family of generalized Fibonacci cubes
- Finding dominating induced matchings in \(S_{1, 1, 5}\)-free graphs in polynomial time
- Subgroup perfect codes in Cayley sum graphs
- Classification of efficient dominating sets of circulant graphs of degree 5
- Weighted efficient domination for P₅-free and P₆-free graphs
- The perfect codes of non-coprime and coprime graphs
- An improved version of Lloyd's theorem
- Weighted efficient domination in two subclasses of P₆-free graphs
This page was built for publication: Perfect codes in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2559208)
