A note on sub-total domination in graphs

2017/01/26 by Davila, Randy
#Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1701.07811

Abstract

Let G be a simple and finite graph without isolated vertices. In this paper we introduce and study a new degree sequence derived invariant called the sub-total domination number, denoted \sub_t(G). In particular, we show that \sub_t(G) serves as a lower bound on γ_t(G), where γ_t(G) denotes the heavily studied total domination number of G.

Related

• The sub-k-domination number of a graph with applications to k-domination
• Disjunctive Total Domination in Graphs
• On total dominating sets in graphs
• Graphs with Large Disjunctive Total Domination Number
• Lower bounds for the total (distance) k-domination number of a graph