On Total Domination in Some Path Related Graphs

S K Vaidya, A D Parmar

Abstract


If G is a graph with vertex set V(G) then dominating set D subset V(G) is called total if every vertex of V(G) is adjacent to at least one vertex of D while it is called equitable if for every vertex u in D there exists a vertex v in V(G) - D such that the degree difference between these vertices is at most one. A dominating set which is both total and equitable is called total equitable dominating set. The minimum cardinality of total dominating set of G is called total domination number of G which is denoted by gamma_t(G). The total equitable domination number of G is the minimum cardinality of total equitable domination number of G which is denoted by gamma_t^e(G). We determine the exact values of total domination number as well as total equitable domination number of some path related graphs.


Full Text:

PDF

References


B. Basavanagoud, V. R. Kulli and V. V. Teli, Equitable Total Domination in Graphs, Journal of Computer and Mathematical Science, 5(2), 2014, 235-241.

E. J. Cockayne, R. M. Dawes and S. T. Hedetniemi, Total Domination in Graphs, Networks, 10, 1980, 211-219.

T. W. Haynes, S. T. Hedetniemi and P. J. Slater, Fundamentals of Domination in Graphs, Marcel Dekker, New York, 1998.

T. W. Haynes, S. T. Hedetniemi and P. J. Slater, Domination in Graphs-Advanced Topics, Marcel Dekker, New York, 1998.

M. A. Henning, A. Yeo, Total Domination in Graphs, Springer, 2013.

V. Swaminathan and K. M. Dharmalingam, Degree Equitable Domination on Graphs, Kragujevac Journal of Mathematics, 35(1), 2011, 191-197.

S. K. Vaidya and A. D. Parmar, Some New Results on Total Equitable Domination in Graphs, (Communicated).

D. B. West, Introduction to Graph Theory, Prentice Hall, New Delhi, India, 2003.


Refbacks

  • There are currently no refbacks.




Web Counters

IJMSC has been indexed in several world class data bases like Google Scholar, DRJI (Directory of Research Journals Indexing) ,Cite Factor, Research Bible.

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.