In this paper, we introduce an even multiplication domination number of a graph and obtain some of its basic results. Also, we provide some bounds for even multiplication domination number for some graphs.

degree of a vertex, domination number, even multiplication domination number

Received: March 19, 2024; Revised: June 24, 2024; Accepted: July 6, 2024; Published: July 18, 2024

How to cite this article: Sejal H. Karkar, On even multiplication domination number of some graphs, Advances and Applications in Discrete Mathematics 41(6) (2024), 441-448. https://doi.org/10.17654/0974165824030

This Open Access Article is Licensed under Creative Commons Attribution 4.0 International License

References:
[1] C. Berge, Theory of Graphs and its Applications, Methuen, London, 1962.
[2] F. Buckley and F. Harary, Distance in Graphs, Addison-Wesley, Redwood City, 1989.
[3] G. Chartrand and P. Zhang, The Steiner number of a graph, Discrete Math. 242 (2002), 41-54.
[4] G. Chartrand, T. W. Haynes, M. A. Henning and P. Zhang, Detour domination in graphs, Ars Combin. 71 (2004), 149-160.
[5] J. Clark and D. A. Holton, A First Look at Graph Theory, World Scientific, 1995.
[6] T. W. Haynes, S. T. Hedetniemi and P. J. Slater, Fundamentals of Domination in Graphs, Marcel Dekker, New York, 1998.
[7] S. T. Hedetniemi and R. C. Laskar, Bibliography on domination in graphs and some basic definitions of domination parameters, Discrete Math. 86 (1990), 257-277.
[8] O. Ore, Theory of graphs, Amer. Math. Soc. Transl. 38 (1962), 206-212.
[9] E. Sampathkumar and L. Pushpa Latha, Strong weak domination and domination balance in graph, Discrete Math. 161 (1996), 235-242.
[10] D. B. West, Introduction to Graph Theory, 2nd ed., Prentice-Hall of India, New Delhi, 2003.