Total domination in graphs
From MaRDI portal
Publication:4912481
Recommendations
Cited in
(only showing first 100 items - show all)- Domination versus disjunctive domination in graphs
- Relating the total domination number and the annihilation number of cactus graphs and block graphs
- 2-limited broadcast domination in subcubic graphs
- Total \(k\)-rainbow domination numbers in graphs
- Bounds on neighborhood total domination in graphs
- A note on the open packing number in graphs
- Game total domination critical graphs
- Total dominator chromatic number of Kneser graphs
- Dominating sets inducing large component in graphs with minimum degree two
- Total domination number of central trees
- Conjectures of TxGraffiti: independence, domination, and matchings
- A new lower bound for the total domination number in graphs proving a Graffiti.pc conjecture
- On the algorithmic complexity of \(k\)-tuple total domination
- Trees with equal total domination and 2-rainbow domination numbers
- Total domination number of middle graphs
- Disjunctive total domination in graphs
- Total dominating sequences in graphs
- scientific article; zbMATH DE number 1424432 (Why is no real title available?)
- Chromatic total domination in graphs
- All my favorite conjectures are critical
- My favorite domination conjectures in graph theory are bounded
- Algorithmic aspects of total Roman and total double Roman domination in graphs
- Global total \(k\)-domination: approximation and hardness results
- Semitotal domination on AT-free graphs and circle graphs
- Domination and dominator colorings in planar graphs with small diameter
- On the weak Roman domination number of lexicographic product graphs
- Total Roman domination in the lexicographic product of graphs
- Hardness results of global total \(k\)-domination problem in graphs
- On upper bounds for total k-domination number via the probabilistic method
- Semitotal bondage numbers of graphs
- Relating the total \(\{2\}\)-domination number with the total domination number of graphs
- A classification of cactus graphs according to their domination number
- Partitioning the vertices of a graph or its complement into a total dominating set and an independent dominating set
- Trees with total Roman domination number equal to Roman domination number plus its domination number: complexity and structural properties
- Complexity of total dominator coloring in graphs
- A survey and classification of Sierpiński-type graphs
- Best possible upper bounds on the restrained domination number of cubic graphs
- Total version of the domination game
- Unique minimum semipaired dominating sets in trees
- A generalization of Petersen's matching theorem
- Total domination on tree operators
- Asymptotic bounds on total domination in regular graphs
- Total domination in plane triangulations
- Extremal graphs for the \(K_{1,2}\)-isolation number of graphs
- From Italian domination in lexicographic product graphs to \(w\)-domination in graphs
- Proof of a conjecture on dominating sets inducing large component in graphs with minimum degree two
- On graphs with equal total domination and Grundy total domination numbers
- Disjoint paired-dominating sets in cubic graphs
- Disjoint total dominating sets in near‐triangulations
- Packing in regular graphs
- The geometric-arithmetic index of trees with a given total domination number
- Paired-domination game played in graphs
- A characterization of trees having a minimum vertex cover which is also a minimum total dominating set
- A classification of cactus graphs according to their total domination number
- A new lower bound on the total domination number of a graph
- Nordhaus-Gaddum bounds for upper total domination
- Equality in a linear Vizing-like relation that relates the size and total domination number of a graph
- A characterization of double Roman trees
- Online dominating set
- Trees with equal total domination and game total domination numbers
- Domination number of an interval catch digraph family and its use for testing uniformity
- On the complexity of multiple bondage in graphs
- Bounds on weak Roman and 2-rainbow domination numbers
- An improved upper bound on the independent domination number in cubic graphs of girth at least six
- Further results on packing related parameters in graphs
- On the number of optimal identifying codes in a twin-free graph
- Total domination in graphs with given girth
- Total vertex-edge domination in trees
- Restrained domination in self-complementary graphs
- Revisiting and improving upper bounds for identifying codes
- Global defensive sets in graphs
- On domatic and total domatic numbers of Cartesian products of graphs
- Game total domination for cycles and paths
- Total k-rainbow reinforcement number in graphs
- Total connected domination game
- Total domination number of central graphs
- Total forcing versus total domination in cubic graphs
- On the L-Grundy domination number of a graph
- Game total domination for cyclic bipartite graphs
- Improved bounds on the \(k\)-tuple (Roman) domination number of a graph
- Generalizations and strengthenings of Ryser's conjecture
- A constructive characterization of trees with equal total domination and disjunctive domination numbers
- A characterization of graphs with semitotal domination number one-third their order
- A complete description of convex sets associated with matchings and edge‐connectivity in graphs
- Graphs with few total dominating sets
- Cubic graphs with total domatic number at least two
- Total domination and vertex-edge domination in tres
- Algorithmic aspects of semitotal domination in graphs
- On total \(f\)-domination: polyhedral and algorithmic results
- Graphs with diameter 2 and large total domination number
- Domination number of middle graphs
- Extremal hypergraphs for matching number and domination number
- Paired domination in trees
- NP-completeness of the independent dominating set problem in the class of cubic planar bipartite graphs
- The finite projective plane and the 5-uniform linear intersecting hypergraphs with domination number four
- Dominating sets inducing large components
- Paired domination stability in graphs
- Algorithmic aspects of upper paired-domination in graphs
- On total domination in the Cartesian product of graphs
- Double outer-independent domination number of 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 Q4912481)
