On total domination and total equitable domination in graphs
Downloads
DOI:
https://doi.org/10.26637/MJM0602/0012Abstract
A dominating set $D$ of a graph $G$ is called total if every vertex of $V(G)$ is adjacent to at least one vertex of $D$, equivalently if $N(D)=V(G)$ then $D$ is called total dominating set. A dominating set $D$ is called total equitable dominating set if it is total and for every vertex in $V(G)-D$ there exists a vertex in $D$ such that they are adjacent and difference between their degrees is at most one. The minimum cardinality of a total (total equitable) dominating set is called total (total equitable) domination number of $G$ which is denoted by $\gamma_t(G)\left(\gamma_t^e(G)\right)$. We have investigated exact value of these parameters for some graphs.
Keywords:
Dominating set, total dominating set, equitable dominating setMathematics Subject Classification:
Mathematics- Pages: 375-380
- Date Published: 01-04-2018
- Vol. 6 No. 02 (2018): Malaya Journal of Matematik (MJM)
S. B. Anupama, Y. B. Maralabhavi and V. M. Goudar, Cototal Edge Domination Number of a Graph, Malaya Journal of Matematik, 4(2), (2016), 325 - 337.
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, S. T. Hedetniemi, Total Domination in Graphs, Networks, 10, (1980), 211 - 219.
D. L. Grinstead and P.J. Slater, Fractional domination and fractional packing in graphs, Congressus Numerantium, $71,(1990), 153-172$.
T. W. Haynes, S. T. Hedetniemi and P. J. Slater, Fundamentals of Domination in Graphs, Marcel Dekker, New York, (1998).
M. A. Henning, A. Yeo, Total Domination in Graphs, Springer, (2013).
J. Joseline Manora and S. Veeramanikandan, Intersection Graph on Non - Split Majority Dominating Graph, Malaya Journal of Matematik, Special Issue(2), (2015), 476 - 480.
A. R. Latheesh Kumar and V. Anil Kumar, A Note on Global Bipartite Domination in Graphs, Malaya Journal of Matematik, 4(3), (2016), 438 - 442.
E.Sampathkumar, The global domination number of a graph, Journal of Mathematical and Physical Sciences, $23(5),(1989), 377-385$.
V. Swaminathan and K. M. Dharmalingam, Degree Equitable Domination on Graphs, Kragujevak Journal of Mathematics, 35(1), (2011), 191 - 197.
S. K. Vaidya and A. D. Parmar, Some New Results on Total Equitable Domination in Graphs, Journal of Computational Mathematica, 1(1), (2017), 98 - 103.
S. K. Vaidya and A. D. Parmar, On Total Domination in Some Path Related Graphs, International Journal of Mathematics and Soft Computing, 7(2), (2017), 103 - 109.
S. K. Vaidya and A. D. Parmar, Total Equitable Bondage Number of a Graph, (Communicated).
S. K. Vaidya and S. H. Karkar, On Strong Domination Number of Corona Related Graphs, Malaya Journal of Matematik, 5(4), (2017), 636 - 640.
D. B. West, Introduction to Graph Theory, 2/e, Prentice Hall of India, New Delhi, (2003).
Similar Articles
- Ruhul Amin, Sk. Md. Abu Nayeem, On the F-index and F-coindex of the line graphs of the subdivision graphs , Malaya Journal of Matematik: Vol. 6 No. 02 (2018): Malaya Journal of Matematik (MJM)
You may also start an advanced similarity search for this article.
Metrics
Published
How to Cite
Issue
Section
License
Copyright (c) 2018 MJM
This work is licensed under a Creative Commons Attribution 4.0 International License.