scientific article; zbMATH DE number 1792607
From MaRDI portal
Publication:4552196
zbMATH Open0993.05104MaRDI QIDQ4552196FDOQ4552196
Authors: Teresa W. Haynes, Frank Harary 
Publication date: 29 August 2002
Title of this publication is not available (Why is that?)
Recommendations
Cited In (only showing first 100 items - show all)
- The average order of dominating sets of a graph
- Double vertex-edge domination in graphs: complexity and algorithms
- On domination in the total torsion element graph of a module
- A simple optimal algorithm for \(k\)-tuple dominating problem in interval graphs
- Some graphs with double domination subdivision number three
- From Italian domination in lexicographic product graphs to \(w\)-domination in graphs
- Restrained {2}-domination in graphs
- Efficient \((j, k)\)-dominating functions
- CONNECTED DOMINATING INDEPENDENT NEIGHBORHOOD POLYNOMIAL OF GRAPHS
- On \((t,r)\) broadcast domination numbers of grids
- Title not available (Why is that?)
- Some domination properties of the total graph of a module with respect to singular submodule
- Location-2-Domination for Product of Graphs
- A new approach on locally checkable problems
- Tuple domination on graphs with the consecutive-zeros property
- On the signed \(2\)-independence number of graphs
- Subexponential fixed-parameter algorithms for partial vector domination
- Double outer-independent domination number of graphs
- Title not available (Why is that?)
- New bounds on the double domination number of trees
- On the double bondage number of graphs products
- 1-MOVABLE DOUBLE DOMINATION IN SOME BINARY OPERATIONS OF GRAPHS
- New and improved results on the signed (total) \(k\)-domination number of graphs
- On the domination of triangulated discs
- Double domination and super domination in trees
- Title not available (Why is that?)
- Revisiting \(k\)-tuple dominating sets with emphasis on small values of \(k\)
- Nordhaus-Gaddum results for the convex domination number of a graph
- Further progress on the total Roman \(\{2\}\)-domination number of graphs
- Total Roman \(\{2\}\)-dominating functions in graphs
- Pendant domination in double graphs
- Subexponential fixed-parameter algorithms for partial vector domination
- Double domination in the Cartesian and tensor products of graphs
- Domination for Latin square graphs
- Double hop dominating sets in graphs
- From \(w\)-domination in graphs to domination parameters in lexicographic product graphs
- A lower bound on the double outer-independent domination number of a tree
- Double domination in signed graphs
- Degree equitable restrained double domination in graphs
- On \(d\)-distance \(m\)-tuple \((\ell,r)\)-domination in graphs
- 3-tuple total domination number of Rook's graphs
- 1-movable double outer-independent domination in graphs
- Domination parameters with number 2: interrelations and algorithmic consequences
- Restricted domination parameters in graphs
- Hardness results, approximation and exact algorithms for liar's domination problem in graphs
- More on the complexity of defensive domination in graphs
- Linear kernels for \(k\)-tuple and liar's domination in bounded genus graphs
- Paired versus double domination in forbidden graph classes
- Domination in the entire nilpotent element graph of a module over a commutative ring
- Domination on hyperbolic graphs
- Characterization of double domination subdivision number of trees
- On three outer-independent domination related parameters in graphs
- DUAL-PERFECT DOMINATION IN GRAPHS
- Double domination in maximal outerplanar graphs
- Algorithmic aspect on total Roman \(\{2\}\)-domination of Cartesian products of paths and cycles
- 3-factor-criticality in double domination edge critical graphs
- Double domination in rooted product graphs
- On the algorithmic complexity of \(k\)-tuple total domination
- On upper bounds for multiple domination numbers of graphs
- A generalised upper bound for the \(k\)-tuple domination number
- A polyhedral view to a generalization of multiple domination
- A realization algorithm for double domination in graphs
- On perfect double dominating sets in grids, cylinders and tori
- Minimum 2-tuple dominating set of permutation graphs
- On the packing numbers in graphs
- Total domination critical and stable graphs upon edge removal
- Nordhaus-Gaddum inequalities for domination in graphs
- \(k\)-domination and \(k\)-independence in graphs: A survey
- Double domination critical and stable graphs upon vertex removal
- On the complexity of multiple bondage in graphs
- Some matching properties in \(4-\gamma_{\times 2}\)-critical graphs
- Liar's domination
- On the \(k\)-tuple domination of generalized de Brujin and Kautz digraphs
- An algorithm for prescribed multiple domination in arbitrary graphs
- \(k\)-tuple total domination in graphs
- The complexity of secure domination problem in graphs
- Combinatorial bounds on paired and multiple domination in triangulations
- (Total) vector domination for graphs with bounded branchwidth
- A note on domination and total domination in prisms
- An optimal algorithm to find minimum k-hop dominating set of interval graphs
- The \(k\)-tuple twin domination in de Bruijn and Kautz digraphs
- Title not available (Why is that?)
- Total \(k\)-domination in Cartesian product graphs
- Total Roman \(\{2\}\)-domination in graphs
- Double total domination of graphs
- The upper bound on \(k\)-tuple domination numbers of graphs
- \(k\)-tuple total domination in cross products of graphs
- Cartesian product graphs and \(k\)-tuple total domination
- Algorithms for minimum \(m\)-connected \(k\)-tuple dominating set problem
- Limited packing and multiple domination problems: polynomial time reductions
- Bounds on double domination numbers of graphs
- Signed Roman \(k\)-domination in graphs
- Characterizations of trees with equal paired and double domination numbers
- A note on Nordhaus-Gaddum inequalities for domination.
- Total limited packing in graphs
- \(k\)-tuple domination in graphs
- On the signed (total) \(k\)-independence number in graphs
- Hardness results and approximation algorithms of \(k\)-tuple domination in graphs
- Connected \(k\)-tuple twin domination in de Bruijn and Kautz digraphs
- Improved bottleneck domination algorithms
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 Q4552196)
