A note on sub-total domination in graphs

From MaRDI portal
Publication:6282479




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 emph{sub-total domination number}, denoted subt(G). In particular, we show that subt(G) serves as a lower bound on gammat(G), where gammat(G) denotes the heavily studied emph{total domination number} of G.











This page was built for publication: A note on sub-total domination in graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6282479)