TARU PUBLICATIONS
Journal of Discrete Mathematical Sciences and Cryptography cover
Open Access ·Peer-reviewed·ISSN (Online): 2169-0065·ISSN (Print): 0972-0529

Monthly Journal: Publishes theoretical and applied research in all areas of Discrete Mathematical Sciences, Cryptography, Combinatorics, Elliptic Curves and Information Security.

Issues up to 2022 co-published with and available at:Taylor & Francis Online
submissions@tarupublications.com
Open Access Research Article

Exploring Even-Even graceful labeling for product of star graphs

, *

* Corresponding author · click or hover a name for details

pp. 2241–2249Vol. 29Issue 6June 2026DOI: 10.47974/JDMSC-2403 Crossmark XML
Received:
01 Jan 2026
Published Online:
20 Jun 2026
Article type:
Research Article
Language:
EN
Article no.:
JDMSC-2403
Pages:
2241–2249

Abstract

An Even-Even graceful labeling involves assigning even labels to both vertices and edges in a graph. The goal is to create a labeling where vertex and edge labels are even integers, and the differences between vertex and edge labels form a set of consecutive positive even integers. This concept explores the relationship between numbers and graph structures and has potential applications in computer science, optimization, and network analysis. This paper demonstrates some new results on Even-Even graceful labeling of m star graphs for m = 4, 5, 6. Additionally, it is shown that double, triple, and quadruple extended star graphs are Even-Even graceful under certain conditions, as discussed in this paper.

Keywords

Subject Classifications

05C7805C38

References

[1] M. A. Ahmed, A. Semanicova-Fenovclkova, M. Baca, J. B. Babujee, and L. Shobana, “On graceful antimagic graphs,” Aequationes Mathematicaes, vol. 97, no. 1, pp. 13-30 (2023). 
[2] M. Basher, “Odd-Even gracefulness of splitting graph of some standard graphs,” Journal of Discrete Mathematical Sciences and Cryptography, vol. 25, no. 2, pp. 491-502 (2022).
[3] M. Basher, “Odd-Even graceful labeling of planar grid and prism graphs,” Journal of Information and Optimization Sciences, vol. 42, no. 4, pp. 747-751 (2021). 
[4] A. K. Behera, D. Mishra, and P. C. Nayak, “Some new classes of even-Even and Odd-Even graceful graphs,” International Journal of Applied Engineering Research, vol. 10, no. 19, pp. 40171-40176 (2015).
[5] R. Boonklurb, N. Ruamkaew, and S. Singhun, “Directed edge-graceful labeling of digraph consisting of c cycles of the same size,” Journal of Discrete Mathematical Sciences and Cryptography, vol. 25, no. 1, pp. 53-72 (2022).
[6] J. A. Gallian, “A dynamic survey of graph labeling,” The Electronic Journal of Combinatorics, DS6 , pp. 1–623 (2022), doi: 10.37236/11668.
[7] G. Lau, W. C. Shiu, H. Ng, Z. Gao, and K. Schaffer, “On K-super graceful graphs with extremal maximum vertex degree,” Journal of Discrete Mathematical Sciences and Cryptography, vol. 27, no. 6, p. 1765 (2024).
[8] A. Rosa, “On certain valuations of the vertices of a graph,” Theory of Graphs (International Symposium Rome), pp. 349-355 (1966).
[9] D. Senthil Kumar, R. Anbarasan, and G. Pushparaj, “Edge-odd graceful labeling of cartesian product of two paths,” Journal of Information and Optimization Sciences, vol. 46, no. 3, pp. 591-599 (2025).
[10] V. Senthilkumar and K. Venkatesan, “Odd vertex even edge root square mean labelling graphs,” Journal of Interdisciplinary Mathematics, vol. 27, no. 5, pp. 1001-1008 (2024).

Views: 61Downloads: 18Citations: 0