Total domination in graphs
From MaRDI portal
Publication:4912481
DOI10.1007/978-1-4614-6525-6zbMATH Open1408.05002OpenAlexW560340026MaRDI QIDQ4912481FDOQ4912481
Authors: Michael A. Henning, A. 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
Recommendations
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Hypergraphs (05C65)
Cited In (only showing first 100 items - show all)
- Game total domination critical graphs
- Trees with equal total domination and 2-rainbow domination numbers
- Relating the total \(\{2\}\)-domination number with the total domination number of graphs
- A classification of cactus graphs according to their domination number
- A classification of cactus graphs according to their total domination number
- Total vertex-edge domination in trees
- A characterization of double Roman trees
- Trees with equal total domination and game total domination numbers
- Online dominating set
- Total k-rainbow reinforcement number in graphs
- A complete description of convex sets associated with matchings and edge‐connectivity in graphs
- Total forcing versus total domination in cubic graphs
- The finite projective plane and the 5-uniform linear intersecting hypergraphs with domination number four
- Algorithmic aspects of upper paired-domination in graphs
- Decreasing the maximum degree of a graph
- Bounds on the semipaired domination number of graphs with minimum degree at least two
- Zero forcing versus domination in cubic graphs
- Partitioning the vertices of a cubic graph into two total dominating sets
- Partitioning the vertices of a graph into two total dominating sets
- Domination in digraphs
- Trees with unique minimum semitotal dominating sets
- Total forcing sets and zero forcing sets in trees
- Zero forcing in claw-free cubic graphs
- Semipaired domination in maximal outerplanar graphs
- Bounds on neighborhood total domination number in graphs
- 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
- Further progress on the total Roman \(\{2\}\)-domination number of graphs
- Isolation of cycles
- Isolation of \(k\)-cliques
- Graphs with large Italian domination number
- A characterization of graphs with given maximum degree and smallest possible matching number
- 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
- Total Roman reinforcement in graphs
- On domination-type invariants of Fibonacci cubes and hypercubes
- Partitioning claw-free subcubic graphs into two dominating sets
- Maker-breaker total domination game
- Graphs with large total 2-rainbow domination number
- The spectral radius and domination number in linear uniform hypergraphs
- Domination in Graphs
- Bounds on the paired domination number of graphs with minimum degree at least three
- The forcing number of graphs with given girth
- \(k\)-broadcast domination and \(k\)-multipacking
- k-Efficient domination: Algorithmic perspective
- Closed formulas for the total Roman domination number of lexicographic product graphs
- Essential upper bounds on the total domination number
- Disjoint dominating and 2-dominating sets in 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
- Double vertex-edge domination
- Domination versus disjunctive domination in graphs
- 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
- Disjunctive total domination in graphs
- Total dominating sequences in graphs
- A characterization of trees having a minimum vertex cover which is also a minimum total dominating set
- A survey and classification of Sierpiński-type graphs
- A new lower bound on the total domination number of a graph
- Total version of the domination game
- On the complexity of multiple bondage in graphs
- On domatic and total domatic numbers of Cartesian products of graphs
- Bounds on weak Roman and 2-rainbow domination numbers
- Total domination in graphs with given girth
- On the number of optimal identifying codes in a twin-free graph
- Total connected domination game
- Global defensive sets in graphs
- Game total domination for cycles and paths
- Graphs with few total dominating sets
- Paired domination in trees
- Paired domination stability in graphs
- On total domination in the Cartesian product of graphs
- Total \(k\)-domination in Cartesian product graphs
- Total domination versus domination in cubic graphs
- Perfectly relating the domination, total domination, and paired domination numbers of a graph
- A note on improved upper bounds on the transversal number of hypergraphs
- Dominator and total dominator colorings in graphs
- Bounds on the connected domination number of a graph
- Locating-total dominating sets in twin-free graphs: a conjecture
- Title not available (Why is that?)
- A new lower bound on the domination number of a graph
- Total dominator colorings and total domination in graphs
- Domination and total domination in hypergraphs
- Graphs with disjoint \(2\)-dominating sets
- Location-domination in line graphs
- Matchings, path covers and domination
- Exact and heuristic algorithms for the weighted total domination problem
- New bounds on the double total domination number of graphs
- Total transversals and total domination in uniform hypergraphs
- Semitotal domination in claw-free cubic graphs
- Semitotal domination in claw-free cubic graphs
- Trees with large \(m\)-eternal domination number
- A note on non-dominating set partitions in graphs
- On the complexity of reinforcement 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 Q4912481)
