Total dominating sequences in graphs

DOI10.1016/j.disc.2016.01.017zbMath1333.05214arXiv1601.07525OpenAlexW2283061813MaRDI QIDQ267175

Douglas F. Rall, Michael A. Henning, Boštjan Brešar

Publication date: 8 April 2016

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1601.07525

zbMATH Keywords

edge covertotal dominationGrundy total domination number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (24)

A new approach on locally checkable problems ⋮ Grundy domination of forests and the strong product conjecture ⋮ Total dominating sequences in trees, split graphs, and under modular decomposition ⋮ Uniform length dominating sequence graphs ⋮ On the L-Grundy domination number of a graph ⋮ On the length of L-Grundy sequences ⋮ Facets of the polytope of legal sequences ⋮ Graphs with equal Grundy domination and independence number ⋮ Computation of Grundy dominating sequences in (co-)bipartite graphs ⋮ Total domination versus domination in cubic graphs ⋮ Unnamed Item ⋮ Zero forcing number, Grundy domination number, and their variants ⋮ On Grundy total domination number in product graphs ⋮ Grundy domination and zero forcing in regular graphs ⋮ Dominating sequences in grid-like and toroidal graphs ⋮ Grundy dominating sequences and zero forcing sets ⋮ On upper total domination versus upper domination in graphs ⋮ The variety of domination games ⋮ An integer programming approach for solving a generalized version of the Grundy domination number ⋮ On graphs all of whose total dominating sequences have the same length ⋮ Grundy domination and zero forcing in Kneser graphs ⋮ GRUNDY DOMINATION SEQUENCES IN GENERALIZED CORONA PRODUCTS OF GRAPHS ⋮ Vertex sequences in graphs ⋮ On graphs with equal total domination and Grundy total domination numbers

Cites Work

• Unnamed Item
• The domination game played on unions of graphs
• Total version of the domination game
• Dominating sequences in graphs
• Total domination of graphs and small transversals of hypergraphs
• Some perfect coloring properties of graphs
• Covering all cliques of a graph
• Small transversals in hypergraphs
• Domination Game and an Imagination Strategy
• Total domination in graphs
• Some remarks on domination
• Semistrong edge coloring of graphs
• Induced Matchings in Subcubic Planar Graphs
• Total Domination in Graphs
• Edge Weighting Functions on Dominating Sets
• Induced Matchings in Subcubic Graphs
• Extremal Problems for Game Domination Number

This page was built for publication: Total dominating sequences in graphs