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 the Nonexistence of Perfect Codes over Finite Fields
- On Trivalent Graphs
- Two theorems on perfect codes
Cited in
(only showing first 100 items - show all)- Perfect codes over graphs
- On the nonexistence of nontrivial perfect e-codes and tight 2e-designs in Hamming schemes H(n,q) with e 3 and q 3
- On the parameters of codes for the Lee and modular distance
- Two infinite classes of perfect codes in metrically regular graphs
- An improved version of Lloyd's theorem
- Nearly perfect codes in distance-regular graphs
- On perfect codes in the Hamming schemes H(n,q) with q arbitrary
- Nonexistence of nontrivial perfect codes in case \(q=p^r_1p^s_2\), \(e\geq 3\)
- Lloyd's theorem for perfect codes
- Efficient edge domination problems in graphs
- Polynomial algorithms for the weighted perfect domination problems on chordal graphs and split graphs
- Regular codes in regular graphs are difficult
- Weighted efficient domination problem on some perfect graphs
- Weighted domination of cocomparability graphs
- Efficient dominating sets in Cayley graphs.
- Tight 2-designs and perfect 1-codes in Doob graphs
- Packing in trees
- Cyclotomic graphs and perfect codes
- A dichotomy for weighted efficient dominating sets with bounded degree vertices
- Efficient location of resources in cylindrical networks
- Bounding the open \(k\)-monopoly number of strong product graphs
- Efficient absorbants in generalized de Bruijn digraphs
- The existence of perfect codes in a family of generalized Fibonacci cubes
- Polynomial-time algorithm for weighted efficient domination problem on diameter three planar graphs
- Weighted efficient domination for some classes of H-free and of (H₁, H₂)-free graphs
- Perfect codes in the graphs O_k
- Weighted independent perfect domination on cocomparability graphs
- The weighted perfect domination problem and its variants
- Worst-case efficient dominating sets in digraphs
- On codes in the projective linear group \(\mathrm{PGL}(2,q)\)
- Perfect codes in Euclidean lattices
- Efficient domination for classes of \(P_6\)-free graphs
- Perfect codes in Cayley sum graphs
- Perfect domination ratios of Archimedean lattices
- Efficient \((j, k)\)-dominating functions
- Distance-regular graphs admitting a perfect 1-code
- Graphs with unique maximum packing of closed neighborhoods
- Efficient domination in Cayley graphs of generalized dihedral groups
- Classification of efficient dominating sets of circulant graphs of degree 5
- Finding dominating induced matchings in P₉-free graphs in polynomial time
- Subgroup regular sets in Cayley graphs
- Dominating induced matchings in \(S_{1 , 2 , 4}\)-free graphs
- Modelling and solving the perfect edge domination problem
- Finding dominating induced matchings in \(S_{2, 2, 3}\)-free graphs in polynomial time
- On subgroup perfect codes in Cayley graphs
- Packing parameters in graphs
- Mim-width. III. Graph powers and generalized distance domination problems
- On efficient domination for some classes of H-free bipartite graphs
- Perfect codes in the discrete simplex
- Further applications of clutter domination parameters to projective dimension
- Perfect codes in direct graph bundles
- Constant 2-labellings and an application to \((r, a, b)\)-covering codes
- Every grid has an independent \([1, 2]\)-set
- Total Roman domination in the lexicographic product of graphs
- Efficient closed domination in digraph products
- \([1,2]\)-sets in graphs
- A Lloyd theorem in weakly metric association schemes
- On the efficiency index of a graph
- Neighbour-transitive codes and partial spreads in generalised quadrangles
- Perfect codes in vertex-transitive graphs
- Injective coloring of graphs revisited
- Perfect codes and independent dominating sets
- A Survey of the Game “Lights Out!”
- Weighted perfect codes in Lee metric
- Weighted efficient domination for P₅-free and P₆-free graphs
- Perfect codes in Doob graphs
- scientific article; zbMATH DE number 4130438 (Why is no real title available?)
- scientific article; zbMATH DE number 4134101 (Why is no real title available?)
- Efficient domination through eigenvalues
- Kernelization of edge perfect code and its variants
- Weighted efficient domination for P₆-free and for P₅-free graphs
- Quasiperfect domination in trees
- Total perfect codes in Cayley graphs
- scientific article; zbMATH DE number 3871186 (Why is no real title available?)
- scientific article; zbMATH DE number 4210053 (Why is no real title available?)
- (Open) packing number of some graph products
- Perfect codes in direct products of cycles
- Perfect codes in Cartesian products of hypercube and multidimensional grid
- scientific article; zbMATH DE number 4164736 (Why is no real title available?)
- scientific article; zbMATH DE number 5543260 (Why is no real title available?)
- Fundamentals of coding type problems
- scientific article; zbMATH DE number 3922532 (Why is no real title available?)
- Perfect codes in the graphs Ok and L(Ok)
- Efficient dominating sets in circulant graphs with domination number prime
- scientific article; zbMATH DE number 4128763 (Why is no real title available?)
- UPPER BOUNDS ON THE LOWER OPEN PACKING NUMBER OF A TREE
- Efficient domination in cubic vertex-transitive graphs
- Perfect codes in Cayley graphs
- Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs
- 1-perfect codes in Sierpiński graphs
- THE PARALLEL ALGORITHMS FOR DETERMINING EDGE-PACKING AND EFFICIENT EDGE DOMINATING SETS IN INTERVAL GRAPHS
- Efficient twin domination in generalized de Bruijn digraphs
- scientific article; zbMATH DE number 921905 (Why is no real title available?)
- On perfect and quasiperfect dominations in graphs
- Generalized distance domination problems and their complexity on graphs of bounded mim-width
- Rainbow perfect domination in lattice graphs
- On non-normal subgroup perfect codes
- The fullerene graphs with a perfect star packing
- Perfect \(t\)-codes in Cayley graphs of groups
- A Taxonomy of Perfect Domination
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)
