PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
February 8, 2024RAIRO - Operations Research3 citationsOpen Access

Semitotal domination versus domination and total domination in trees

View Full Paper
WZWei Zhuang

Key Points

Key points are not available for this paper at this time.

Abstract

A set S of vertices in G is a semitotal dominating set of G if it is a dominating set of G and every vertex in S is within distance 2 of another vertex of S . The semitotal domination number , γ t 2 ( G ), is the minimum cardinality of a semitotal dominating set of G . Clearly, γ ( G ) ≤ γ t 2 ( G ) ≤ γ t ( G ). In this paper, for any nontrivial tree T that is not a star, we investigate the ratios γ t 2 ( T )/ γ ( T ) and γ t ( T )/ γ t 2 ( T ), and provide constructive characterizations of trees achieving the upper bounds.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Wei Zhuang (2024) studied this question.

synapsesocial.com/papers/68e7b938b6db64358770f7b1https://doi.org/10.1051/ro/2024037
Ask AI
Helpful
Bookmark
Share
View Full Paper