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

DOI10.3906/MAT-2001-58zbMATH Open1493.05223OpenAlexW3088062940MaRDI QIDQ5099751FDOQ5099751

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

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

zbMATH Keywords

domination numbertotal domination number

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• On a class of graphs with large total domination number
• Graph-theoretic parameters concerning domination, independence, and irredundance
• Trees with large total domination number
• Total domination versus domination in cubic graphs
• Title not available (Why is that?)

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)