Total domination in graphs
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Global defensive \(k\)-alliances in graphs
- Total domination in graphs with given girth
- A note on dominating sets and average distance
- On total domination vertex critical graphs of high connectivity
- Vertex and edge covers with clustering properties: Complexity and algorithms
- Upper bounds on the upper signed total domination number of graphs
- On the total \(\{k\}\)-domination number of Cartesian products of graphs
- A new bound on the total domination subdivision number
- Total restrained domination in cubic graphs
- Total domination in planar graphs of diameter two
- A survey of stratified domination in graphs
- A note on total domination
- Dominating sets and domatic number of circular arc graphs
- Dominating sets in social network graphs
- Regular totally domatically full graphs
- The least point covering and domination numbers of a graph
- Incorporating negative-weight vertices in certain vertex-search graph algorithms
- A note on the Hamiltonian circuit problem on directed path graphs
- On the algorithmic complexity of twelve covering and independence parameters of graphs
- The sequence of upper and lower domination, independence and irredundance numbers of a graph
- The diversity of domination
- Stratification and domination in graphs
- On the computational complexity of upper total domination
- Signed total domination in graphs.
- Interpolation theorems for domination numbers of a graph
- An algorithm for prescribed multiple domination in arbitrary graphs
- Total \([1,2]\)-domination in graphs
- Complexity of \(k\)-tuple total and total \(\{k\}\)-dominations for some subclasses of bipartite graphs
- Cubic graphs with total domatic number at least two
- Graphs with few total dominating sets
- Algorithm complexity of neighborhood total domination and \((\rho,\gamma_{\mathrm{nt}})\)-graphs
- Total \(k\)-domination in Cartesian product graphs
- Total domination versus domination in cubic graphs
- On total \(f\)-domination: polyhedral and algorithmic results
- Essential upper bounds on the total domination number
- Coupon-coloring and total domination in Hamiltonian planar triangulations
- Restricted total domination in graphs
- Maximum sizes of graphs with given domination parameters
- Relating the size of a connected graph to its total and restricted domination numbers
- Total domination and least domination in a tree
- Total domination subdivision numbers of trees
- The diameter of total domination vertex critical graphs
- Universal minimal total dominating functions of trees
- Least domination in a graph
- Nordhaus-Gaddum inequalities for domination in graphs
- Total domination and the Caccetta-Häggkvist conjecture
- The total \(\{k\}\)-domatic number of wheels and complete graphs
- Edge lifting and total domination in graphs
- On bondage numbers of graphs: a survey with some comments
- On upper total domination versus upper domination in graphs
- The hub number, girth and Mycielski graphs
- On the total outer-connected domination in graphs
- Hardness results and approximation algorithm for total liar's domination in graphs
- Exact and heuristic algorithms for the weighted total domination problem
- A characterization of trees based on edge-deletion and its applications for domination-type invariants
- Domination related parameters in the generalized lexicographic product of graphs
- Bounding the k-rainbow total domination number
- Total Roman \(\{2\}\)-reinforcement of graphs
- On graphs all of whose total dominating sequences have the same length
- A new upper bound on the total domination number in graphs with minimum degree six
- A continuous generalization of domination-like invariants
- Protection of lexicographic product graphs
- Semitotal domination of Harary graphs
- Upper total domination in claw-free cubic graphs
- Bounding the trace function of a hypergraph with applications
- Total and paired domination numbers of cylinders
- Corona domination number of graphs
- Local mending
- On graphs with equal total domination and Grundy total domination numbers
- Further results on packing related parameters in graphs
- A new approach on locally checkable problems
- Total domination in regular graphs
- Bounds on domination parameters in graphs: a brief survey
- Total protection of lexicographic product graphs
- Further progress on the total Roman \(\{2\}\)-domination number of graphs
- On the forcing domination and the forcing total domination numbers of a graph
- Maker-breaker total domination game
- Domination on hyperbolic graphs
- The numerical invariants concerning the total domination for generalized Petersen graphs
- \(F_3\)-domination problem of graphs
- Total restrained domination in claw-free graphs
- The geodetic number of the lexicographic product of graphs
- On a conjecture of Murty and Simon on diameter 2-critical graphs
- New results on connected dominating structures in graphs
- Total Roman reinforcement in graphs
- Bounds on neighborhood total domination number in graphs
- The total bondage numbers and efficient total dominations of vertex-transitive graphs
- The complexity of finding harmless individuals in social networks
- Perfectly relating the domination, total domination, and paired domination numbers of a graph
- Total dominator colorings and total domination in graphs
- Improving a Nordhaus-Gaddum type bound for total domination using an algorithm involving vertex disjoint stars
- Vertex-addition strategy for domination-like invariants
- Total $k$-domination in strong product graphs
- On the weak Roman domination number of lexicographic product graphs
- Nordhaus-Gaddum bounds for total domination
- On matching and semitotal domination in graphs
- Total and paired domination numbers of toroidal meshes
- Bounds on neighborhood total domination in graphs
- Algorithmic aspect of stratified domination in graphs
- Efficient self-stabilizing algorithms for minimal total \(k\)-dominating sets in graphs
This page was built for publication: Total domination in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3892276)