A note on total domination

DOI10.1016/0012-365X(84)90145-6zbMath0576.05028OpenAlexW2036945144MaRDI QIDQ1065020

Robert B. Allan, Renu C. Laskar, Stephen T. Hedetniemi

Publication date: 1984

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

Full work available at URL: https://doi.org/10.1016/0012-365x(84)90145-6

zbMATH Keywords

independent domination numbertotal domination numberirredundance numberirredundant settotally dominating set

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (05C99)

Related Items (20)

Universal minimal total dominating functions of trees ⋮ The diversity of domination ⋮ Distance irredundance and connected domination numbers of a graph ⋮ An algorithm to find two distance domination parameters in a graph ⋮ Some inequalities about connected domination number ⋮ On the ratio between 2-domination and total outer-independent domination numbers of trees ⋮ Domination chain: characterisation, classical complexity, parameterised complexity and approximability ⋮ Bounds on a generalized domination parameter ⋮ Convexity of minimal total dominating functions in graphs ⋮ Conical and spherical graphs ⋮ Algorithms for graphs with small octopus ⋮ Regular totally domatically full graphs ⋮ The least point covering and domination numbers of a graph ⋮ Bounds relating generalized domination parameters ⋮ Cores of simplicial complexes ⋮ Minus total domination in graphs ⋮ Irredundance ⋮ Distance Domination in Graphs ⋮ Bibliography on domination in graphs and some basic definitions of domination parameters ⋮ An algorithm for prescribed multiple domination in arbitrary graphs

Cites Work

• Graph-theoretic parameters concerning domination, independence, and irredundance
• Total domination in graphs
• Towards a theory of domination in graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A note on total domination