scientific article; zbMATH DE number 19197

From MaRDI portal
Publication:3976627





[For the entire collection see Zbl 0734.00014.] Let \(G\) be a graph. Lower bounds of the \(n\)-total domination number \(\gamma_{tn}(G)\) and its relations with the total domination number \(\gamma_ t(G)\) are studied in this paper. Let \(\Delta\) and \(\delta\) be the maximum degree and the minimum degree of \(G\) and \(p\) be the order of \(G\). The main theorem in this paper is: if \(G\) is connected, then \(\gamma_{tn}(G)\geq\gamma_ t(G)+\delta-1\).




Cited in
(25)








This page was built for publication:

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