An algorithm to check the equality of total domination number and double of domination number in graphs

DOI10.3906/MAT-2001-58MaRDI QIDQ5099751zbMATH OpenOpenAlexFDO

Authors Selim Bahadır

Publication date 26 August 2022

Published in Turkish Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3906/mat-2001-58

zbMATH Keywords

domination numbertotal domination number

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Relating the total \(\{2\}\)-domination number with the total domination number of graphs
• Graphs with double domination numbers
• On a class of graphs with large total domination number
• Double total domination of graphs
• A realization algorithm for double domination in graphs

Cites work

• Graph-theoretic parameters concerning domination, independence, and irredundance
• scientific article; zbMATH DE number 5902609 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• On a class of graphs with large total domination number
• Total domination versus domination in cubic graphs
• Trees with large total domination number

Cited in

(1)

• Algorithms for secondary domination

This page was built for publication: An algorithm to check the equality of total domination number and double of domination number in graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5099751)