scientific article; zbMATH DE number 975419
From MaRDI portal
Publication:5284096
Cited in
(67)- Perfect r-domination in the Kronecker product of two cycles, with an application to diagonal/toroidal mesh
- Characterizing r-perfect codes in direct products of two and three cycles
- On perfect Lee codes
- Polynomial algorithms for the weighted perfect domination problems on chordal graphs and split graphs
- Weighted efficient domination problem on some perfect graphs
- Weighted domination of cocomparability graphs
- A dichotomy for weighted efficient dominating sets with bounded degree vertices
- Efficient location of resources in cylindrical networks
- Weighted independent perfect domination on cocomparability graphs
- The weighted perfect domination problem and its variants
- On bondage numbers of graphs: a survey with some comments
- Perfect domination ratios of Archimedean lattices
- Efficient and non-efficient domination of \(\mathbb{Z}\)-stacked Archimedean lattices
- Efficient \((j, k)\)-dominating functions
- Perfect domination polynomial of homogeneous caterpillar graphs and of full binary trees
- A new upper bound for the perfect Italian domination number of a tree
- A characterization of perfect Roman trees
- Identifying codes on directed de Bruijn graphs
- Every grid has an independent \([1, 2]\)-set
- A generalization of Lee codes
- A Survey of the Game “Lights Out!”
- \((1, j)\)-set problem in graphs
- Efficient domination through eigenvalues
- Total perfect codes in Cayley graphs
- Varieties of Roman Domination
- Perfect domination in rectangular grid graphs
- Finding Lean Induced Cycles in Binary Hypercubes
- scientific article; zbMATH DE number 91051 (Why is no real title available?)
- Efficient dominating sets in circulant graphs with domination number prime
- scientific article; zbMATH DE number 637526 (Why is no real title available?)
- Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs
- On perfect and quasiperfect dominations in graphs
- Rainbow perfect domination in lattice graphs
- Equitable fair domination in graphs
- The fullerene graphs with a perfect star packing
- A Taxonomy of Perfect Domination
- On the perfect differential of a graph
- Perfect Domination, Roman Domination and Perfect Roman Domination in Lexicographic Product Graphs
- ON GRAPHS WITH PAIRWISE DISJOINT EFFICIENT DOMINATING SETS AND EFFICIENT DOMINATION IN TREES IN TERMS OF SUPPORT VERTICES
- Total perfect codes in graphs realized by commutative rings
- Independent [1,2]-domination of grids via min-plus algebra
- Efficient dominating sets in circulant graphs
- On perfect double dominating sets in grids, cylinders and tori
- Hereditary efficiently dominatable graphs
- Algorithms to determine an independent dominating set of \(\mathrm{ESC}(n,k)\)
- Outer complete fair domination in graphs
- Smallest independent dominating sets in Kronecker products of cycles
- On the domination number of $t$-constrained de Bruijn graphs
- scientific article; zbMATH DE number 7727296 (Why is no real title available?)
- k-Efficient domination: Algorithmic perspective
- On the domination number and the 2-packing number of Fibonacci cubes and Lucas cubes
- A resource assignment problem on graphs
- Efficient domination in grid graphs
- (1,2)-PDS in graphs with the small number of vertices of large degrees
- On graph-based codes over Ramanujan graphs: existence and design of infinite families
- Optimal vertex set partitions into different closed neighborhoods in powers of graphs and their complements
- Quasi perfect codes in the Cartesian product of some graphs
- 1,2-efficiency in grid graphs
- Perfect truncated-metric codes in lattice graphs and superlattice graphs
- On perfect Italian domination in graphs
- Locating fair domination in graphs
- Algorithms for unipolar and generalized split graphs
- Efficient domination in circulant graphs with two chord lengths
- An almost complete description of perfect codes in direct products of cycles
- Perfect codes in direct products of cycles-a complete characterization
- A tight bound on the number of mobile servers to guarantee transferability among dominating configurations
- Quotients of Gaussian graphs and their application to perfect codes
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5284096)
