scientific article; zbMATH DE number 975419
From MaRDI portal
Publication:5284096
zbMATH Open0862.05064MaRDI QIDQ5284096FDOQ5284096
Authors: Marilynn L. Livingston, Q. F. Stout 
Publication date: 19 May 1997
Title of this publication is not available (Why is that?)
Recommendations
Trees (05C05) Directed graphs (digraphs), tournaments (05C20) Extremal problems in graph theory (05C35) Distance in graphs (05C12) Paths and cycles (05C38)
Cited In (57)
- Efficient dominating sets in circulant graphs with domination number prime
- Perfect domination in rectangular grid graphs
- On perfect double dominating sets in grids, cylinders and tori
- A tight bound on the number of mobile servers to guarantee transferability among dominating configurations
- Efficient \((j, k)\)-dominating functions
- Perfect domination polynomial of homogeneous caterpillar graphs and of full binary trees
- Efficient location of resources in cylindrical networks
- Title not available (Why is that?)
- Finding Lean Induced Cycles in Binary Hypercubes
- A generalization of Lee codes
- Quotients of Gaussian graphs and their application to perfect codes
- Weighted domination of cocomparability graphs
- \((1, j)\)-set problem in graphs
- Characterizing \(r\)-perfect codes in direct products of two and three cycles
- The fullerene graphs with a perfect star packing
- Perfect Domination, Roman Domination and Perfect Roman Domination in Lexicographic Product Graphs
- On the domination number and the 2-packing number of Fibonacci cubes and Lucas cubes
- Title not available (Why is that?)
- A dichotomy for weighted efficient dominating sets with bounded degree vertices
- Perfect \(r\)-domination in the Kronecker product of two cycles, with an application to diagonal/toroidal mesh
- Efficient domination through eigenvalues
- Rainbow perfect domination in lattice graphs
- Algorithms for unipolar and generalized split graphs
- A new upper bound for the perfect Italian domination number of a tree
- On perfect Lee codes
- An almost complete description of perfect codes in direct products of cycles
- Smallest independent dominating sets in Kronecker products of cycles
- Total perfect codes in Cayley graphs
- A Taxonomy of Perfect Domination
- On bondage numbers of graphs: a survey with some comments
- Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs
- Efficient domination in circulant graphs with two chord lengths
- Equitable fair domination in graphs
- Perfect codes in direct products of cycles-a complete characterization
- Weighted efficient domination problem on some perfect graphs
- On perfect and quasiperfect dominations in graphs
- Varieties of Roman Domination
- A Survey of the Game “Lights Out!”
- Hereditary efficiently dominatable graphs
- On the domination number of $t$-constrained de Bruijn graphs
- The weighted perfect domination problem and its variants
- Weighted independent perfect domination on cocomparability graphs
- Polynomial algorithms for the weighted perfect domination problems on chordal graphs and split graphs
- k-Efficient domination: Algorithmic perspective
- Identifying codes on directed de Bruijn graphs
- Independent [1,2]-domination of grids via min-plus algebra
- A characterization of perfect Roman trees
- On the perfect differential of a graph
- ON GRAPHS WITH PAIRWISE DISJOINT EFFICIENT DOMINATING SETS AND EFFICIENT DOMINATION IN TREES IN TERMS OF SUPPORT VERTICES
- Perfect domination ratios of Archimedean lattices
- Efficient and non-efficient domination of \(\mathbb{Z}\)-stacked Archimedean lattices
- Every grid has an independent \([1, 2]\)-set
- Efficient dominating sets in circulant graphs
- Outer complete fair domination in graphs
- Efficient domination in grid graphs
- A resource assignment problem on graphs
- Title not available (Why is that?)
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)
