Construction of Halin graph with perfect k-ary tree and its independent domination number

DOI10.1080/09720529.2019.1689607zbMath1495.05204OpenAlexW2996555825WikidataQ126592399 ScholiaQ126592399MaRDI QIDQ5036750

N. Parvathi, D. Anandhababu

Publication date: 23 February 2022

Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09720529.2019.1689607

zbMATH Keywords

independent domination numberdomination numberHalin graph

Mathematics Subject Classification ID

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

Related Items (2)

Leech index of a tree ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On approximating the minimum independent dominating set
• On domination and independent domination numbers of a graph
• The sequence of upper and lower domination, independence and irredundance numbers of a graph
• Independent domination in graphs: A survey and recent results
• The independent domination numbers of strong product of two cycles
• Complementary total domination in graphs

This page was built for publication: Construction of Halin graph with perfect k-ary tree and its independent domination number