scientific article; zbMATH DE number 1792607
From MaRDI portal
Publication:4552196
zbMath0993.05104MaRDI QIDQ4552196
Teresa W. Haynes, Frank Harary
Publication date: 29 August 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (only showing first 100 items - show all)
A note on the k-tuple domination number of graphs ⋮ A new approach on locally checkable problems ⋮ A lower bound on the double outer-independent domination number of a tree ⋮ A polyhedral view to a generalization of multiple domination ⋮ (Total) vector domination for graphs with bounded branchwidth ⋮ Tuple domination on graphs with the consecutive-zeros property ⋮ New bounds on the double domination number of trees ⋮ Unnamed Item ⋮ 3-factor-criticality in double domination edge critical graphs ⋮ Double domination and super domination in trees ⋮ On the \(k\)-tuple domination of de Bruijn and Kautz digraphs ⋮ Characterization of double domination subdivision number of trees ⋮ Revisiting \(k\)-tuple dominating sets with emphasis on small values of \(k\) ⋮ Unnamed Item ⋮ Total Roman \(\{2\}\)-dominating functions in graphs ⋮ Further progress on the total Roman \(\{2\}\)-domination number of graphs ⋮ Domination in the entire nilpotent element graph of a module over a commutative ring ⋮ From Italian domination in lexicographic product graphs to w-domination in graphs ⋮ Subexponential Fixed-Parameter Algorithms for Partial Vector Domination ⋮ On three outer-independent domination related parameters in graphs ⋮ Linear kernels for \(k\)-tuple and liar's domination in bounded genus graphs ⋮ Total domination critical and stable graphs upon edge removal ⋮ Cartesian product graphs and k-tuple total domination ⋮ Nordhaus-Gaddum inequalities for domination in graphs ⋮ A generalized linear time algorithm for an optimal \(k\)-distance dominating set of a weighted tree ⋮ Solving the minimum M-dominating set problem by a continuous optimization approach based on DC programming and DCA ⋮ \(k\)-tuple total domination in cross products of graphs ⋮ Domination parameters with number 2: interrelations and algorithmic consequences ⋮ New and improved results on the signed (total) k-domination number of graphs ⋮ On the algorithmic complexity of \(k\)-tuple total domination ⋮ On the signed (total) \(k\)-independence number in graphs ⋮ Total $k$-domination in strong product graphs ⋮ On the \(k\)-tuple domination of generalized de Brujin and Kautz digraphs ⋮ A linear time algorithm for optimal \(k\)-hop dominating set of a tree ⋮ On the total \(k\)-domination in graphs ⋮ A note on domination and total domination in prisms ⋮ Domination on hyperbolic graphs ⋮ The multiple domination and limited packing problems in graphs ⋮ Total \(k\)-domination in Cartesian product graphs ⋮ The complexity of secure domination problem in graphs ⋮ Some graphs with double domination subdivision number three ⋮ A note on Nordhaus-Gaddum inequalities for domination. ⋮ On upper bounds for multiple domination numbers of graphs ⋮ A new lower bound on the double domination number of a graph ⋮ The upper bound on \(k\)-tuple domination numbers of graphs ⋮ Limited packing and multiple domination problems: polynomial time reductions ⋮ \(k\)-domination and \(k\)-independence in graphs: A survey ⋮ Nordhaus-Gaddum results for the convex domination number of a graph ⋮ Location-2-Domination for Product of Graphs ⋮ An optimal algorithm to find minimum k-hop dominating set of interval graphs ⋮ Minimum 2-tuple dominating set of an interval graph ⋮ The average order of dominating sets of a graph ⋮ Variations of \(Y\)-dominating functions on graphs ⋮ Restricted domination parameters in graphs ⋮ A generalised upper bound for the \(k\)-tuple domination number ⋮ The \(k\)-tuple domination number revisited ⋮ Subexponential fixed-parameter algorithms for partial vector domination ⋮ k-tuple restrained domination in graphs ⋮ Hardness results, approximation and exact algorithms for liar's domination problem in graphs ⋮ \(k\)-tuple total domination in graphs ⋮ Hardness results and approximation algorithm for total liar's domination in graphs ⋮ Paired versus double domination in \(K_{1,r}\)-free graphs ⋮ Some matching properties in \(4-\gamma_{\times 2}\)-critical graphs ⋮ Improved bottleneck domination algorithms ⋮ Characterizations of trees with equal paired and double domination numbers ⋮ Liar's domination ⋮ A note on double domination in graphs ⋮ Algorithms for minimum \(m\)-connected \(k\)-tuple dominating set problem ⋮ Combinatorial bounds on paired and multiple domination in triangulations ⋮ The \(k\)-tuple twin domination in de Bruijn and Kautz digraphs ⋮ Minimum 2-tuple dominating set of permutation graphs ⋮ On the double bondage number of graphs products ⋮ Degree equitable restrained double domination in graphs ⋮ Onk-tuple domination of random graphs ⋮ Domination for Latin square graphs ⋮ Total limited packing in graphs ⋮ Unnamed Item ⋮ Double domination in signed graphs ⋮ On the packing numbers in graphs ⋮ \(k\)-tuple domination in graphs ⋮ Multiple Domination ⋮ Double vertex-edge domination in graphs: complexity and algorithms ⋮ On \(d\)-distance \(m\)-tuple \((\ell,r)\)-domination in graphs ⋮ 3-tuple total domination number of Rook's graphs ⋮ Hardness results and approximation algorithms of \(k\)-tuple domination in graphs ⋮ Total Roman {2}-domination in graphs ⋮ Polynomial reductions between the Limited Packing and Tuple Domination problems in graphs ⋮ Double domination in lexicographic product graphs ⋮ Connected \(k\)-tuple twin domination in de Bruijn and Kautz digraphs ⋮ Liar's domination in graphs ⋮ Double domination in maximal outerplanar graphs ⋮ New algorithms for weighted \(k\)-domination and total \(k\)-domination problems in proper interval graphs ⋮ On the complexity of multiple bondage in graphs ⋮ On the signed 2-independence number of graphs ⋮ A simple optimal algorithm for \(k\)-tuple dominating problem in interval graphs ⋮ On \((t,r)\) broadcast domination numbers of grids ⋮ Efficient \((j, k)\)-dominating functions ⋮ Double outer-independent domination number of graphs ⋮ Double hop dominating sets in graphs ⋮ An algorithm for prescribed multiple domination in arbitrary graphs
This page was built for publication:
