Tadpole domination in duplicated graphs

DOI10.1142/S1793830921500038zbMath1475.05128OpenAlexW3047119574MaRDI QIDQ5012796

P. A. Khuda Bakhash, Manal N. Al-Harere

Publication date: 25 November 2021

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830921500038

zbMATH Keywords

tadpole graphduplication of \(G\)tadpole domination number

Mathematics Subject Classification ID

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

Related Items (3)

A note on no-free-lunch theorem ⋮ Equality co-neighborhood domination in graphs ⋮ Tadpole domination number of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Tadpole domination in duplicated graphs