Perfect codes in graphs
From MaRDI portal
Publication:2559208
DOI10.1016/0095-8956(73)90042-7zbMath0256.94009OpenAlexW2010608390MaRDI QIDQ2559208
Publication date: 1973
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(73)90042-7
Related Items
Perfect codes and universal adjacency spectra of commuting graphs of finite groups, The fullerene graphs with a perfect star packing, Perfect t-codes in Cayley graphs of groups, A Taxonomy of Perfect Domination, GROUP PERFECT CODE IN COMMUTING ORDER PRODUCT PRIME GRAPH, ON GRAPHS WITH PAIRWISE DISJOINT EFFICIENT DOMINATING SETS AND EFFICIENT DOMINATION IN TREES IN TERMS OF SUPPORT VERTICES, Hereditary Efficiently Dominatable Graphs, The (non-)existence of perfect codes in Lucas cubes, A general construction of strictly Neumaier graphs and a related switching, Characterizing subgroup perfect codes by 2-subgroups, Extended formulations for perfect domination problems and their algorithmic implications, k-Efficient domination: Algorithmic perspective, Subset Perfect Codes of Finite Commutative Rings Over Induced Subgraphs of Unit Graphs, On subgroup perfect codes in Cayley sum graphs, Finding dominating induced matchings in \(P_{10}\)-free graphs in polynomial time, Neighbour-transitive codes in Kneser graphs, Unnamed Item, Subgroup Perfect Codes in Cayley Graphs, Parameterized complexity of minimum membership dominating set, Unnamed Item, The (non-)existence of perfect codes in Fibonacci cubes, On efficient domination for some classes of \(H\)-free chordal graphs, On efficient domination for some classes of \(H\)-free chordal graphs, A note on the open packing number in graphs, On the efficiency index of a graph, On the nonexistence of nontrivial perfect e-codes and tight 2e-designs in Hamming schemes H(n,q) with e\(\geq 3\) and q\(\geq 3\), Cyclotomic graphs and perfect codes, Regular codes in regular graphs are difficult, UPPER BOUNDS ON THE LOWER OPEN PACKING NUMBER OF A TREE, A dichotomy for weighted efficient dominating sets with bounded degree vertices, Weighted efficient domination problem on some perfect graphs, 1-perfect codes in Sierpiński graphs, Efficient domination through eigenvalues, Kernelization of edge perfect code and its variants, Weighted Efficient Domination for $$P_6$$ -Free and for $$P_5$$ -Free Graphs, Quasiperfect domination in trees, Efficient location of resources in cylindrical networks, Graphs with unique maximum packing of closed neighborhoods, Efficient domination in Cayley graphs of generalized dihedral groups, Total perfect codes in Cayley graphs, A Lloyd theorem in weakly metric association schemes, THE PARALLEL ALGORITHMS FOR DETERMINING EDGE-PACKING AND EFFICIENT EDGE DOMINATING SETS IN INTERVAL GRAPHS, Classification of efficient dominating sets of circulant graphs of degree 5, Finding dominating induced matchings in \(P_9\)-free graphs in polynomial time, An almost complete description of perfect codes in direct products of cycles, Subgroup regular sets in Cayley graphs, Weighted independent perfect domination on cocomparability graphs, The weighted perfect domination problem and its variants, Dominating induced matchings in \(S_{1 , 2 , 4}\)-free graphs, Modelling and solving the perfect edge domination problem, Weighted domination of cocomparability graphs, Constant 2-labellings and an application to \((r, a, b)\)-covering codes, Neighbour-transitive codes and partial spreads in generalised quadrangles, Efficient dominating sets in circulant graphs with domination number prime, Every grid has an independent \([1, 2\)-set], Total Roman domination in the lexicographic product of graphs, Weighted Efficient Domination for $P_5$-Free and $P_6$-Free Graphs, (Open) packing number of some graph products, Finding dominating induced matchings in \(S_{2, 2, 3}\)-free graphs in polynomial time, Bounding the open \(k\)-monopoly number of strong product graphs, Efficient closed domination in digraph products, On perfect codes in Cartesian products of graphs, On non-normal subgroup perfect codes, Efficient dominating sets in Cayley graphs., Perfect codes in vertex-transitive graphs, Injective coloring of graphs revisited, Perfect Codes in Cayley Graphs, Unnamed Item, Weighted efficient domination in two subclasses of \(P_6\)-free graphs, Worst-case efficient dominating sets in digraphs, Efficient domination in cubic vertex-transitive graphs, \([1,2\)-sets in graphs], On subgroup perfect codes in Cayley graphs, Perfect codes in direct products of cycles-a complete characterization, Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs, On the parameters of codes for the Lee and modular distance, Efficient twin domination in generalized de Bruijn digraphs, Queen's domination using border squares and \((A,B)\)-restricted domination, 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, Finding dominating induced matchings in \(P_8\)-free graphs in polynomial time, Efficient dominating sets in circulant graphs, Perfect codes in circulant graphs, Packing parameters in graphs, Quotients of Gaussian graphs and their application to perfect codes, 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, Perfect codes in the graphs Ok and L(Ok), Nonexistence of nontrivial perfect codes in case \(q=p^r_1p^s_2\), \(e\geq 3\), Efficient domination for classes of \(P_6\)-free graphs, Weighted codes in Lee metrics, 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_1, H_2)\)-free graphs, Fundamentals of coding type problems, Tight 2-designs and perfect 1-codes in Doob graphs, Perfect codes in Cayley sum graphs, Finding dominating induced matchings in \(S_{1, 1, 5}\)-free graphs in polynomial time, Subgroup perfect codes in Cayley sum graphs, More on limited packings in graphs, A Survey of the Game “Lights Out!”, Packing in trees, Weighted perfect codes in Lee metric, Perfect domination ratios of Archimedean lattices, Perfect codes in the graphs \(O_k\), Mim-width. III. Graph powers and generalized distance domination problems, On efficient domination for some classes of \(H\)-free bipartite graphs, On perfect and quasiperfect dominations in graphs, Perfect codes in the discrete simplex, Rainbow perfect domination in lattice graphs, Perfect codes over graphs, Further applications of clutter domination parameters to projective dimension, Perfect codes in direct graph bundles, Perfect codes in direct products of cycles, Perfect codes in Cartesian products of hypercube and multidimensional grid, Efficient edge domination problems in graphs, Polynomial algorithms for the weighted perfect domination problems on chordal graphs and split graphs, Efficient \((j, k)\)-dominating functions, Distance-regular graphs admitting a perfect 1-code, Optimal tristance anticodes in certain graphs
Cites Work
