You Lu, Xinmin Hou, Jun‐Ming Xu, Ning Li
Abstract
Let t(G) and 2(G) be the total domination number and the 2domination number of a graph G, respectively. It has been shown that: t(T ) 2(T ) for any tree T . In this paper, we provide a constructive characterization of those trees with equal total domination number and 2-domination number.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Let t(G) and 2(G) be the total domination number and the 2domination number of a graph G, respectively. It has been shown that: t(T ) 2(T ) for any tree T . In this paper, we provide a constructive characterization of those trees with equal total domination number and 2-domination number.
Key concepts: Domination analysis, Characterization (materials science), Combinatorics, Mathematics, Constructive, Graph, Tree (set theory), Discrete mathematics