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

DOI10.3906/mat-2001-58zbMath1493.05223OpenAlexW3088062940MaRDI QIDQ5099751

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

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

Cites Work

• Total domination versus domination in cubic graphs
• Graph-theoretic parameters concerning domination, independence, and irredundance
• On a Class of Graphs with Large Total Domination Number
• Unnamed Item
• Unnamed Item
• Unnamed Item

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