Total domination in graphs
From MaRDI portal
Publication:4912481
Recommendations
Cited in
(only showing first 100 items - show all)- Total \(k\)-domination in Cartesian product graphs
- Total domination versus domination in cubic graphs
- Acyclic total dominating sets in cubic graphs
- Graphs with equal domination and certified domination numbers
- Decreasing the maximum degree of a graph
- New bounds on the double domination number of trees
- On the semitotal forcing number of a graph
- Bounds on the semipaired domination number of graphs with minimum degree at least two
- Zero forcing versus domination in cubic graphs
- Superlative total domination in graphs
- Total Roman \(\{2\}\)-domination in graphs
- Bounds and extremal graphs for total dominating identifying codes
- Perfectly relating the domination, total domination, and paired domination numbers of a graph
- \( P_5\)-isolation in graphs
- Strength of strongest dominating sets in fuzzy graphs
- Bounds on the disjunctive total domination number of a tree
- Vertices contained in all or in no minimum semitotal dominating set of a tree
- scientific article; zbMATH DE number 2192162 (Why is no real title available?)
- Partitioning the vertices of a cubic graph into two total dominating sets
- Structures of domination in graphs
- The complexity of finding harmless individuals in social networks
- Bounds on zero forcing using (upper) total domination and minimum degree
- Upper bounds on the \(k\)-tuple (Roman) domination number of a graph
- Analysis of Vulnerability of Some Transformation Networks
- Total outer connected vertex-edge domination
- Trees with unique minimum semitotal dominating sets
- On Grundy total domination number in product graphs
- A characterization of graphs with disjoint total dominating sets
- Dominator and total dominator colorings in graphs
- Traceability of connected domination critical graphs
- Domination in digraphs
- Total domination in generalized prisms and a new domination invariant
- Partitioning the vertices of a graph into two total dominating sets
- A note on improved upper bounds on the transversal number of hypergraphs
- Relating the outer-independent total Roman domination number with some classical parameters of graphs
- Relating the total domination number and the annihilation number for quasi-trees and some composite graphs
- Total forcing sets and zero forcing sets in trees
- A Note on Isolate Domination Number of a Cubic Graph
- Fractional domatic, idomatic, and total domatic numbers of a graph
- On \(f\)-domination: polyhedral and algorithmic results
- The annihilation number does not bound the 2-domination number from the above
- Semitotal domination: new hardness results and a polynomial-time algorithm for graphs of bounded mim-width
- On three domination-based identification problems in block graphs
- On the double total dominator chromatic number of graphs
- Zero forcing in claw-free cubic graphs
- Progress towards the two-thirds conjecture on locating-total dominating sets
- Semipaired domination in maximal outerplanar graphs
- Locating-total dominating sets in twin-free graphs: a conjecture
- On domination in signed graphs
- Bounds on the connected domination number of a graph
- Bounds on neighborhood total domination number in graphs
- On the domination number of a graph and its shadow graph
- A probabilistic algorithm for bounding the total restrained domination number of a \(K_{1 , \ell}\) -free graph
- A characterization of graphs with given total coalition numbers
- A characterization of graphs whose vertex set can be partitioned into a total dominating set and an independent dominating set
- Partial domination -- the isolation number of a graph
- Differentiating-total domination: approximation and hardness results
- On graphs all of whose total dominating sequences have the same length
- Domination parameters of a graph and its complement
- Complexity of \(k\)-tuple total and total \(\{k\}\)-dominations for some subclasses of bipartite graphs
- Matching and domination numbers in \(r\)-uniform hypergraphs
- On dominating graph of graphs, median graphs, partial cubes and complement of minimal dominating sets
- A new lower bound on the domination number of a graph
- The Slater and sub-\(k\)-domination number of a graph with applications to domination and \(k\)-domination
- Paired-domination game played on paths
- The Sierpiński domination number
- Total dominator colorings and total domination in graphs
- Further progress on the total Roman \(\{2\}\)-domination number of graphs
- Total protection of lexicographic product graphs
- Location-domination in line graphs
- Matchings, path covers and domination
- Isolation of cycles
- Isolation of \(k\)-cliques
- scientific article; zbMATH DE number 7666858 (Why is no real title available?)
- Domination and total domination in hypergraphs
- Graphs with large Italian domination number
- Total dominating sequences in trees, split graphs, and under modular decomposition
- A characterization of graphs with given maximum degree and smallest possible matching number
- Total transversals and total domination in uniform hypergraphs
- On total domination and minimum maximal matchings in graphs
- Exact and heuristic algorithms for the weighted total domination problem
- A new upper bound on the total domination number in graphs with minimum degree six
- On (1,2)-domination in cubic graphs
- Affine planes and transversals in 3-uniform linear hypergraphs
- Independent domination subdivision in graphs
- Protection of lexicographic product graphs
- A characterization of graphs with given maximum degree and smallest possible matching number. II
- New bounds on the double total domination number of graphs
- Graphs with disjoint \(2\)-dominating sets
- Total Roman reinforcement in graphs
- Perfect Italian domination in graphs: complexity and algorithms
- B-disjunctive total domination in graphs: algorithm and hardness results
- Algorithmic aspects of \textsc{Upper Domination}: a parameterised perspective
- \([1,2]\)-sets and \([1,2]\)-total sets in trees with algorithms
- Independence in 5-uniform hypergraphs
- Data reductions and combinatorial bounds for improved approximation algorithms
- On the total and strong version for Roman dominating functions in graphs
- Maker-breaker total domination game
- On domination-type invariants of Fibonacci cubes and hypercubes
- Partitioning claw-free subcubic graphs into two dominating sets
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 Q4912481)
