加载中…
Let be a connected graph. A non-empty is a - of if is a total dominating set and for every pair , is a total dominating set in , or there exist such that and are adjacent to and , respectively, and is a total dominating set in . The - of , denoted by , is the minimum cardinality of a 2-movable total dominating set of . A 2-movable total dominating set with cardinality equal to is called -set of . This paper present the 2-movable total domination in the join and corona of graphs.

生成讲解博客的中文版本

生成AI智能校验的中文版本