← Back to Volume 45, Issue 1 Contents
SPLIT DOMATIC NUMBER OF A GRAPH
Y. Therese Sunitha Mary1, R. Kala2
1 Department of Mathematics, St. Xavier’s College, Palayamkottai - 627 002, Tamil Nadu, India
2 Department of Mathematics, Manonmaniam Sundaranar University, Tirunelveli - 627 012, Tamil Nadu, India
Volume: 45Issue: 1Pages: 29–39Year: 2023ISSN: 0970-5120
⬇ Download Full PDF
Abstract
A dominating set $D\subseteq V(G)$ is a split dominating set if the induced subgraph $<V-D>$ is disconnected. The minimum cardinality of a split dominating set is called the split domination number of $G$, denoted by $\gamma_s(G)$. The maximum order of a partition of $V(G)$ into split dominating sets of G is called the split domatic number of G and is denoted by $d_s(G)$. In this paper, we study several aspects of these two parameters and find certain classes of graphs that are domatically full.
Keywords: Domination, Domination Number, Split Domination, Split Domination Number, Domatic Number, Split Domatic Number.
MSC 2020: 05C69
How to Cite
Y. Therese Sunitha Mary, R. Kala, SPLIT DOMATIC NUMBER OF A GRAPH, Journal of the Indian Academy of Mathematics, 45(1) (2023), 29–39.
References
- E. J. Cockayne and S. T. Hedetniemi (1977): Towards a theory of domination in graphs, Networks, Vol. 7, pp. 247-261.
- F. Harary (1969): Graph theory, Addison Wesley, Reading Mass.
- T. W. Haynes, S. T. Hedetniemi and P. J. Slater (1998): Fundamentals of Domination in graphs, Marcel Dekker, Inc..
- T. W. Haynes, S. T. Hedetniemi and P. J. Slater (1998): Domination in Graphs, Advanced Topics, Marcel Dekker.
- V. R. Kulli and B. Janakiram, (1997): The split domination number of a graph, Graph Theory Notes of New York, Vol. XXX11, pp. 16-19.
- Y. Therese Sunitha Mary and R. Kala (2007): The nonsplit domination number of a graph, Proceedings of the National Conference on Mathematical and Computational Models, December, PSG College of Technology, Coimbatore, INDIA, 218-224.
© Journal of the Indian Academy of Mathematics