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
- Chromatic total domination in graphs
- Hardness results of global total \(k\)-domination problem in graphs
- On the weak Roman domination number of lexicographic product graphs
- Total Roman domination in the lexicographic product of graphs
- 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
- Complexity of total dominator coloring in graphs
- Packing in regular graphs
- On graphs with equal total domination and Grundy total domination numbers
- Domination number of an interval catch digraph family and its use for testing uniformity
- Revisiting and improving upper bounds for identifying codes
- A constructive characterization of trees with equal total domination and disjunctive domination numbers
- Game total domination for cyclic bipartite graphs
- Cubic graphs with total domatic number at least two
- Algorithmic aspects of semitotal domination in graphs
- On total \(f\)-domination: polyhedral and algorithmic results
- Graphs with diameter 2 and large total domination number
- NP-completeness of the independent dominating set problem in the class of cubic planar bipartite graphs
- Extremal hypergraphs for matching number and domination number
- Bounds and extremal graphs for total dominating identifying codes
- Total Roman \(\{2\}\)-domination in graphs
- Title not available (Why is that?)
- Structures of domination in 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
- The complexity of finding harmless individuals in social networks
- On Grundy total domination number in product graphs
- Total domination in generalized prisms and a new domination invariant
- On \(f\)-domination: polyhedral and algorithmic results
- Semitotal domination: new hardness results and a polynomial-time algorithm for graphs of bounded mim-width
- On domination in signed graphs
- On the domination number of a graph and its shadow graph
- 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
- Total dominating sequences in trees, split graphs, and under modular decomposition
- 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
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)
