SECURE MONOPHONIC DOMINATION NUMBER OF PRODUCT OF GRAPHS

K. Sunitha; D. Josephine Divya

SECURE MONOPHONIC DOMINATION NUMBER OF PRODUCT OF GRAPHS

Abstract

Let $G$ be a graph which is connected. A monophonic dominating set $M$ is said to be a secure monophonic dominating set $S_m$(written as SMD set) of $G$ if for each $g \in V\backslash M$ there exists $f \in M$ such that $g$ is adjacent to $f$ and $S_m=(M \backslash \{f\}\cup\{g\}$ is a monophonic dominating set. The smallest cardinality of a secure monophonic dominating set of $G$ is the secure monophonic domination number of $G$ and the notation is $\gamma_{sm}(G).$ In this article, we discuss the secure monophonic domination number of product of graphs.

Keywords

References

[1] Arul Paul Sudhahar, P., Mohammed Abdul Khayyoom, M. and Sadiquali, A., (2016), Connected Edge Monophonic Domination number of a Graph, International Journal of Computer Applications, 145(12), pp. 18-21.
[2] Arul paul Sudhahar, P. and Jebi, W., (2024), Monophonic domination polynomial of the path graph, Notes on Number theory and Discrete Mathematics, 30(4), pp. 787-796.
[3] Buckley, F. and Harary, F., (1990), Distance in Graph, Addition-Wesley-Wood City, CA.
[4] Carmelito E. Go and Sergio R. Canoy, (2011), Domination in the Corona and Join of Graphs, International Mathematical Forum, 6(16), pp. 763-771.
[5] Cockayne, E. J., Favaron, O. and Mynhardt, C. M., (2003), Secure Domination, Weak Roman Domination and forbidden subgraph, Bulletin of the Institute of Combinatorics and its Applications, 39, pp. 87-100.
[6] Cockayne, E. J., Grobler, P. J. P., Grundlingh, W. R., Munganga, J. and van Vuuren, J. H., (2005), Protection of a graph, Utilitas. Mathematica, 67, pp. 19-32.
[7] Enrico L. Enriquez and Evelyn Samper-Enriquez, (2019), Convex Secure Domination in the join and cartesian product of graphs, Journal of Global Research in Mathematical Archives, ISSN 2320-5822, 6, pp. 1-7.
[8] Frucht, R., and Harary, F., (1970), On the corona of Two Graphs, Aequationes Mathematicae, 4(3), pp. 322-325.

[9] Gisha Saraswathy, Manju K. Menon, (2025), Secure Domination Number of Generalized Thorn Graphs, Journal of Hyperstructures, 14(1), pp. 93-105.
[10] Harary, F., (1972), Graph theory, Addison-Wesley, Reading, Massachusetts.
[11] Haynes, T. W., Hedetniemi, S. T. and Slater, P. J., (1998), Fundamentals of Domination in Graphs, Marcel Dekker, New York.
[12] John, J., Arul Paul Sudhahar, P. and Stalin, D., (2019), On the (M,D) number of a graph, ProyeccionesJournal of Mathematics, 38(2), pp. 225-266.
[13] John, J. and Arul Paul Sudhahar, P., (2012), The Monophonic Domination Number of a Graph, Proceedings of the International Conference on Mathematics and Business Management, 1, pp. 142-145.
[14] Klostermeyer, W. F. and Mynhardt, C. M., (2008), Secure domination and secure total domination in graphs, Discussiones Mathematicae Graph Theory, 28, pp. 267-284.
[15] Mynhardt, C. M., Swart, H. C. and Ungerer, L., (2005), Excellent trees and secure domination, Utilitas Mathematica, 67, pp. 255-267.
[16] Rashmi, S. V. D., Arumugam, S. and Gartland, P., (2017), Perfect Secure Domination in Graphs, Categories and General Algebraic Structures with Applications, 7, pp. 125-140.
[17] Sadiquali, A. and Arul Paul Sudhahar, P., (2017), Monophonic Domination in Special Graph Structures and Related Properties, International Journal of Mathematical Analysis, 11(22), pp. 1089-1102.
[18] Saloni R. Kundaliya and Tushharkumar Bhatt, (2025), Pro-Secure Domination in Cartesian and Strong product of two graphs, Advances and Applications in Discrete Mathematics, 42(7), pp. 657-664.
[19] Shibata, Y. and Kikuchi, Y., (2000), Graph products based on the distance in graphs, IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences, E83-A(3), pp. 459464.
[20] Sunitha, K., Josephine Divya, D., (2024) Secure Monophonic Domination Number of Graphs and its Complement, ICAMD-2024 Proceedings, ISBN: 978-93-340-5234-3, pp. 51-52.
[21] Sunitha, K., Josephine Divya, D., (2024) Secure Monophonic Domination Number of Subdivision of Graphs, Journal of Hyperstructures, 13(2), pp. 247-256.
[22] Sunitha, K., Josephine Divya, D., (2025) Secure Monophonic Global Domination Number and Total Secure Monophonic Domination Number of Subdivision of Graphs, International Journal of Emerging Technologies and Innovative Research, 12(11), pp f432-f435.

Details

Primary Language

English

Subjects

Combinatorics and Discrete Mathematics (Excl. Physical Combinatorics)

Journal Section

Research Article

Authors

K. Sunitha This is me
0009-0003-1485-9385
India

D. Josephine Divya ^* This is me
0009-0001-8864-477X
India

Publication Date

August 7, 2026

Submission Date

November 20, 2025

Acceptance Date

May 12, 2026

Published in Issue

Year 2026 Volume: 16 Number: 8

IZ

https://izlik.org/JA97AD54XM

Cite

RIS / Bibtex

APA

Sunitha, K., & Divya, D. J. (2026). SECURE MONOPHONIC DOMINATION NUMBER OF PRODUCT OF GRAPHS. TWMS Journal of Applied and Engineering Mathematics, 16(8), 953-963. https://izlik.org/JA97AD54XM

AMA

1.Sunitha K, Divya DJ. SECURE MONOPHONIC DOMINATION NUMBER OF PRODUCT OF GRAPHS. JAEM. 2026;16(8):953-963. https://izlik.org/JA97AD54XM

Chicago

Sunitha, K., and D. Josephine Divya. 2026. “SECURE MONOPHONIC DOMINATION NUMBER OF PRODUCT OF GRAPHS”. TWMS Journal of Applied and Engineering Mathematics 16 (8): 953-63. https://izlik.org/JA97AD54XM.

EndNote

Sunitha K, Divya DJ (August 1, 2026) SECURE MONOPHONIC DOMINATION NUMBER OF PRODUCT OF GRAPHS. TWMS Journal of Applied and Engineering Mathematics 16 8 953–963.

IEEE

[1]K. Sunitha and D. J. Divya, “SECURE MONOPHONIC DOMINATION NUMBER OF PRODUCT OF GRAPHS”, JAEM, vol. 16, no. 8, pp. 953–963, Aug. 2026, [Online]. Available: https://izlik.org/JA97AD54XM

ISNAD

Sunitha, K. - Divya, D. Josephine. “SECURE MONOPHONIC DOMINATION NUMBER OF PRODUCT OF GRAPHS”. TWMS Journal of Applied and Engineering Mathematics 16/8 (August 1, 2026): 953-963. https://izlik.org/JA97AD54XM.

JAMA

1.Sunitha K, Divya DJ. SECURE MONOPHONIC DOMINATION NUMBER OF PRODUCT OF GRAPHS. JAEM. 2026;16:953–963.

MLA

Sunitha, K., and D. Josephine Divya. “SECURE MONOPHONIC DOMINATION NUMBER OF PRODUCT OF GRAPHS”. TWMS Journal of Applied and Engineering Mathematics, vol. 16, no. 8, Aug. 2026, pp. 953-6, https://izlik.org/JA97AD54XM.

Vancouver

1.K. Sunitha, D. Josephine Divya. SECURE MONOPHONIC DOMINATION NUMBER OF PRODUCT OF GRAPHS. JAEM [Internet]. 2026 Aug. 1;16(8):953-6. Available from: https://izlik.org/JA97AD54XM