Total Domination in Graphs

DOI10.1007/978-1-4614-6525-6zbMath1408.05002OpenAlexW560340026MaRDI QIDQ4912481

Michael A. Henning, Anders Yeo

Publication date: 4 April 2013

Published in: Springer Monographs in Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-4614-6525-6

zbMATH Keywords

undirected graphstotal dominating set

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Hypergraphs (05C65) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items

Total double Roman domination in graphs, A new lower bound on the total domination number of a graph, Strength of strongest dominating sets in fuzzy graphs, Chromatic total domination in graphs, PENDANT TOTAL DOMINATION NUMBER OF SOME GENERALIZED GRAPHS, Revisiting and Improving Upper Bounds for Identifying Codes, REGNANT AND CAPTIVE DOMINATION IN SOME GENERALIZED GRAPHS, Unnamed Item, From Italian domination in lexicographic product graphs to w-domination in graphs, Paired-Domination Game Played in Graphs, On the perfect differential of a graph, Trees with total Roman domination number equal to Roman domination number plus its domination number: complexity and structural properties, Graphs with disjoint 2-dominating sets, On the L-Grundy domination number of a graph, Total domination number of middle graphs, Conjecture of TxGraffiti: Independence, domination, and matchings, On domination-type invariants of Fibonacci cubes and hypercubes, Nordhaus-Gaddum bounds for upper total domination, NP-completeness of the independent dominating set problem in the class of cubic planar bipartite graphs, Paired domination stability in graphs, Unnamed Item, A complete description of convex sets associated with matchings and edge‐connectivity in graphs, \( P_5\)-isolation in graphs, On domination in signed graphs, The total co-independent domination number of some graph operations, On the double total dominator chromatic number of graphs, A Note on Isolate Domination Number of a Cubic Graph, On dominating graph of graphs, median graphs, partial cubes and complement of minimal dominating sets, A sharp upper bound on the cycle isolation number of graphs, Graphs with equal domination and certified domination numbers, On domatic and total domatic numbers of Cartesian products of graphs, Paired-domination game played on cycles, A linear-time algorithm for semitotal domination in strongly chordal graphs, Fault-tolerant total domination via submodular function approximation, k-Efficient domination: Algorithmic perspective, 3-component domination numbers in graphs, Incidence‐free sets and edge domination in incidence graphs, Singleton coalition graph chains, On total domination and minimum maximal matchings in graphs, Bounds and extremal graphs for total dominating identifying codes, Dominating sets inducing large component in graphs with minimum degree two, On upper bounds for total k-domination number via the probabilistic method, Disjoint total dominating sets in near‐triangulations, The geometric-arithmetic index of trees with a given total domination number, Unnamed Item, Double vertex-edge domination, Packing in regular graphs, Unnamed Item, Unnamed Item, A note on improved upper bounds on the transversal number of hypergraphs, Semitotal domination in claw-free cubic graphs, Total domination and vertex-edge domination in tres, Unnamed Item, The forcing number of graphs with given girth, TOTAL DOMINATION POLYNOMIALS OF SOME SPLITTING GRAPHS, Unnamed Item, Perfect roman domination in regular graphs, Semitotal domination in claw-free cubic graphs, Total connected domination game, Partial domination - the isolation number of a graph, Algorithmic aspects of total Roman ${2}$-domination in graphs, k-tuple restrained domination in graphs, Hardness results of global total \(k\)-domination problem in graphs, A characterization of trees having a minimum vertex cover which is also a minimum total dominating set, Total dominator chromatic number of a graph, NP-completeness results for partitioning a graph into total dominating sets, Complexity and algorithms for semipaired domination in graphs, Matching, path covers, and total forcing sets, Fractional Domatic, Idomatic, and Total Domatic Numbers of a Graph, Dominator and Total Dominator Colorings in Graphs, An Introduction to Game Domination in Graphs, Domination and Total Domination in Hypergraphs, Domination in Digraphs, Roman Domination in Graphs, On disjunctive domination in graphs, Domination number of an interval catch digraph family and its use for testing uniformity, Well-totally-dominated graphs, Closed formulas for the total Roman domination number of lexicographic product graphs, Relating the total domination number and the annihilation number of cactus graphs and block graphs, A characterization of graphs with disjoint total dominating sets, A note on the open packing number in graphs, Total $k$-Rainbow domination numbers in graphs, Domination versus disjunctive domination in graphs, A constructive characterization of trees with equal total domination and disjunctive domination numbers, Total Roman {2}-domination in graphs, Unnamed Item, Partitioning the Vertices of a Graph into Two Total Dominating Sets, All My Favorite Conjectures Are Critical, My Favorite Domination Conjectures in Graph Theory Are Bounded, Total Transversals in Hypergraphs and Their Applications, GRUNDY DOMINATION SEQUENCES IN GENERALIZED CORONA PRODUCTS OF GRAPHS, Total k-rainbow reinforcement number in graphs, Trees with equal total domination and 2-rainbow domination numbers, Double outer-independent domination number of graphs, Algorithmic aspects of total Roman {3}-domination in graphs, On the domination number of a graph and its shadow graph, Total domination in cubic Knodel graphs, Acyclic total dominating sets in cubic graphs, Total Roman domination subdivision number in graphs, Trees with equal total domination and game total domination numbers, Improved bounds on the \(k\)-tuple (Roman) domination number of a graph, Generalizations and strengthenings of Ryser's conjecture, Total domination in regular graphs, New bounds on the double domination number of trees, On the semitotal forcing number of a graph, Progress towards the total domination game \(\frac{3}{4}\)-conjecture, Dominating sets inducing large components, 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, 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, Paired domination in trees, Perfect Italian domination in graphs: complexity and algorithms, Decreasing the maximum degree of a graph, Complexity of paired domination in AT-free and planar graphs, Minimal graphs with disjoint dominating and paired-dominating sets, Traceability of connected domination critical graphs, On three outer-independent domination related parameters in graphs, Partitioning claw-free subcubic graphs into two dominating sets, Graphs with diameter 2 and large total domination number, Upper bounds on the \(k\)-tuple (Roman) domination number of a graph, Vertex-addition strategy for domination-like invariants, Asymptotic bounds on total domination in regular graphs, Perfect graphs for domination games, On the total and strong version for Roman dominating functions in graphs, The annihilation number does not bound the 2-domination number from the above, Total forcing sets and zero forcing sets in trees, Isolation of cycles, Trees with unique minimum semitotal dominating sets, On 2-step and hop dominating sets in graphs, Some notes on the isolate domination in graphs, Neighborhood covering and independence on \(P_4\)-tidy graphs and tree-cographs, Matching and domination numbers in \(r\)-uniform hypergraphs, Independent domination in subcubic graphs of girth at least six, Domination versus independent domination in graphs of small regularity, Isolation of \(k\)-cliques, Construction for trees without domination critical vertices, Roman domination in direct product graphs and rooted product graphs, Semipaired domination in claw-free cubic graphs, Graphs with large semipaired domination number, Maker-breaker total domination game, Total $k$-domination in strong product graphs, Total Roman domination in the lexicographic product of graphs, On the weak Roman domination number of lexicographic product graphs, Algorithmic Aspects of Disjunctive Total Domination in Graphs, 2-limited broadcast domination in subcubic graphs, Algorithm and hardness results on neighborhood total domination in graphs, On the coalition number of trees, Relating the total \(\{2\}\)-domination number with the total domination number of graphs, Graphs with large Italian domination number, On matching and semitotal domination in graphs, Independent transversal total domination versus total domination in trees, On Grundy total domination number in product graphs, Bounds on neighborhood total domination in graphs, Global total \(k\)-domination: approximation and hardness results, Efficient self-stabilizing algorithms for minimal total \(k\)-dominating sets in graphs, Equality in a linear Vizing-like relation that relates the size and total domination number of a graph, Bounds on the connected domination number of a graph, Total domination in plane triangulations, The numerical invariants concerning the total domination for generalized Petersen graphs, Restrained domination in self-complementary graphs, On \(f\)-domination: polyhedral and algorithmic results, Quasi-total Roman domination in graphs, The Slater and sub-\(k\)-domination number of a graph with applications to domination and \(k\)-domination, Algorithmic aspects of upper paired-domination in graphs, b-Disjunctive Total Domination in Graphs: Algorithm and Hardness Results, Domination and matching in power and generalized power hypergraphs, Disjoint dominating and 2-dominating sets in graphs, Zero forcing in claw-free cubic graphs, Semitotal domination: new hardness results and a polynomial-time algorithm for graphs of bounded mim-width, A classification of cactus graphs according to their total domination number, On total domination and hop domination in diamond-free graphs, Total Roman reinforcement in graphs, Game total domination for cyclic bipartite graphs, Algorithmic Aspects of Upper Domination: A Parameterised Perspective, Bounds on neighborhood total domination number in graphs, Outer-independent total Roman domination in graphs, Packing and domination parameters in digraphs, New algorithms for weighted \(k\)-domination and total \(k\)-domination problems in proper interval graphs, Upper total domination in claw-free cubic graphs, A new lower bound on the domination number of a graph, Semipaired domination in maximal outerplanar graphs, Perfect domination ratios of Archimedean lattices, On the complexity of multiple bondage in graphs, A note on the complexity of locating-total domination in graphs, Disjoint paired-dominating sets in cubic graphs, The complexity of finding harmless individuals in social networks, Perfectly relating the domination, total domination, and paired domination numbers of a graph, On the ensemble of optimal dominating and locating-dominating codes in a graph, Unique minimum semipaired dominating sets in trees, A generalization of Petersen's matching theorem, Total domination on tree operators, Triangles and (total) domination in subcubic graphs, An improved upper bound on the independent domination number in cubic graphs of girth at least six, Total dominator colorings and total domination in graphs, On graphs with equal total domination and Grundy total domination numbers, Further results on packing related parameters in graphs, A classification of cactus graphs according to their domination number, Total dominator chromatic number of Kneser graphs, Analysis of Vulnerability of Some Transformation Networks, Total outer connected vertex-edge domination, Total dominator coloring number of middle graphs, Complexity of total dominator coloring in graphs, Optimal linear‐Vizing relationships for (total) domination in graphs, Unnamed Item, Disjunctive total domination in graphs, Total dominating sequences in graphs, Global defensive sets in graphs, Game total domination for cycles and paths, Algorithmic aspects of total Roman and total double Roman domination in graphs, Semitotal domination on AT-free graphs and circle graphs, Domination and dominator colorings in planar graphs with small diameter, Locating-total dominating sets in twin-free graphs: a conjecture, Location-domination in line graphs, Matchings, path covers and domination, Trees with large \(m\)-eternal domination number, On the complexity of reinforcement in graphs, A note on non-dominating set partitions in graphs, Complexity of \(k\)-tuple total and total \(\{k\}\)-dominations for some subclasses of bipartite graphs, On total domination in the Cartesian product of graphs, Total dominating sequences in trees, split graphs, and under modular decomposition, Domination parameters with number 2: interrelations and algorithmic consequences, 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, Total transversals and total domination in uniform hypergraphs, Complexity of total outer-connected domination problem in graphs, Cubic graphs with total domatic number at least two, Domination parameters of a graph and its complement, On the total \(k\)-domination in graphs, \([1,2\)-sets and \([1,2]\)-total sets in trees with algorithms], Total domination stability in graphs, Extremal hypergraphs for matching number and domination number, Independence in 5-uniform hypergraphs, Data reductions and combinatorial bounds for improved approximation algorithms, Nordhaus-Gaddum bounds for total Roman domination, Graphs with few total dominating sets, The matcher game played in graphs, Vertices contained in all or in no minimum semitotal dominating set of a tree, Bounds on the disjunctive total domination number of a tree, Total \(k\)-domination in Cartesian product graphs, The 4/5 upper bound on the game total domination number, Total domination versus domination in cubic graphs, An improved upper bound of edge-vertex domination number of a tree, Total domination versus paired-domination in regular graphs, Infinite families of circular and Möbius ladders that are total domination game critical, On the number of optimal identifying codes in a twin-free graph, Total domishold graphs: a generalization of threshold graphs, with connections to threshold hypergraphs, On the total forcing number of a graph, Algorithmic aspects of semitotal domination in graphs, A Vizing-type result for semi-total domination, Domination game on uniform hypergraphs, On total \(f\)-domination: polyhedral and algorithmic results, A characterization of double Roman trees, NP-hardness of multiple bondage in graphs, On a class of graphs between threshold and total domishold graphs, Total domination edge critical graphs with total domination number three and many dominating pairs, Total version of the domination game, Progress on the Murty-Simon conjecture on diameter-2 critical graphs: a survey, Perfect Italian domination in trees, Online dominating set, (Total) domination in prisms, A survey and classification of Sierpiński-type graphs, Graphs that are simultaneously efficient open domination and efficient closed domination graphs, Essential upper bounds on the total domination number, Domination game: extremal families for the 3/5-conjecture for forests, Some comments on the Slater number, The finite projective plane and the 5-uniform linear intersecting hypergraphs with domination number four, Total forcing and zero forcing in claw-free cubic graphs, Total forcing versus total domination in cubic graphs, Edge weighting functions on semitotal dominating sets, Bounds on the semipaired domination number of graphs with minimum degree at least two, Zero forcing versus domination in cubic graphs, Exact and heuristic algorithms for the weighted total domination problem, Secure total domination in graphs: bounds and complexity, A note on double domination in graphs, Graphs with large total 2-rainbow domination number, Partitioning the vertices of a cubic graph into two total dominating sets, Transversals in 4-uniform hypergraphs, A characterization of graphs with given maximum degree and smallest possible matching number, Matching and edge-connectivity in graphs with given maximum degree, On the domination number of graphs with minimum degree six, Differentiating-total domination: approximation and hardness results, On graphs all of whose total dominating sequences have the same length, Game total domination critical graphs, \(k\)-broadcast domination and \(k\)-multipacking, Total domination in generalized prisms and a new domination invariant, A new upper bound on the total domination number in graphs with minimum degree six, On (1,2)-domination in cubic graphs, A continuous generalization of domination-like invariants, Independent domination subdivision in graphs, Affine planes and transversals in 3-uniform linear hypergraphs, Bounds on weak Roman and 2-rainbow domination numbers, The spectral radius and domination number in linear uniform hypergraphs, An \(O(n+m)\) time algorithm for computing a minimum semitotal dominating set in an interval graph, Bounds on the paired domination number of graphs with minimum degree at least three, Protection of lexicographic product graphs, The semitotal domination problem in block graphs, New bounds on the double total domination number of graphs, A characterization of graphs with given maximum degree and smallest possible matching number. II, Independent domination in subcubic graphs, Local metric dimension for graphs with small clique numbers, Domination versus total domination in claw-free cubic graphs, Perfect double Roman domination of trees, Double domination in lexicographic product graphs, Semitotal domination of Harary graphs