On some variations of domination in graphs

Abstract

The concepts Superior dominating sub graph, Paired equitable domination and Delta domination are introduced. The introduced domination parameter for some class of graphs like Path, Cycle, Complete graph and Complete bipartite graph are calculated. newlineWe deal with different types of dominations like Complementary tree total domination and Complementary tree paired domination. The characterization of these parameters are also discussed. Complementary tree paired domination number of merging of two graphs G1 and G2, a graph G with path Pn and a graph G with Cn are calculated. The relationship between total domination number and complementary tree paired domination number in terms of support vertices and leaves is proved. Last section of this thesis provides an interesting application ofdomination theory with labeled graph. A new combinatorial technique is applied to encrypt and decrypt any number N using efficient domination concept on labeled graph. newline newline newline