Bounds on weak and strong total domination in graphs

DOI10.5614/ejgta.2016.4.1.10zbMath1467.05181OpenAlexW2339280209MaRDI QIDQ5006580

Nader Jafari Rad, M. H. Akhbari

Publication date: 16 August 2021

Published in: Electronic Journal of Graph Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.5614/ejgta.2016.4.1.10

zbMATH Keywords

Nordhaus-Gaddumstrong total dominationweak total domination

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (4)

Graphs with diameter 2 and large total domination number ⋮ Independent strong domination in complementary prisms ⋮ Total Roman domination for proper interval graphs ⋮ The strong domination problem in block graphs and proper interval graphs

Cites Work

• On the ratio between 2-domination and total outer-independent domination numbers of trees
• Strong weak domination and domination balance in a graph
• Total and paired-domination numbers of a tree
• Bounds on the strong domination number
• On Complementary Graphs
• Total domination in graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Bounds on weak and strong total domination in graphs