Complementary total domination in graphs

Abstract

Taylor & Francis makes every effort to ensure the accuracy of all the information (the "Content") contained in the publications on our platform. However, Taylor & Francis, our agents, and our licensors make no representations or warranties whatsoever as to the accuracy, completeness, or suitability for any purpose of the Content. Any opinions and views expressed in this publication are the opinions and views of the authors, and are not the views of or endorsed by Taylor & Francis. The accuracy of the Content should not be relied upon and should be independently verified with primary sources of information. Taylor and Francis shall not be liable for any losses, actions, claims, proceedings, demands, costs, expenses, damages, and other liabilities whatsoever or howsoever caused arising directly or indirectly in connection with, in relation to or arising out of the use of the Content.

Superlative Total Domination in Graphs

“…(ii) If V − D contains no a DS, then D is called a maximal dominating set, abbreviated as M DS, of G, see [19]. (iii) If V − T contains a T DS, say T ′ , then T ′ is called an inverse total dominating set, abbreviated as IT DS of G with respect to T , see [5,18]. (iv) If V − T contains no a T DS, then T is called a maximal total dominating set, abbreviated as M T DS, of G, see [21].…”