Some Results on Cordial Related Labelings of The Flower Snark Graph

  • Mahadityasinh Sarvaiya
  • Mahesh Parsania
Keywords: Edge Product Cordial labeling, k-Product Cordial labeling, Flower Snark Graph

Abstract

This work is proposed to derive some results on the Flower Snark graph Jn in view of the fulfillment of the Total Edge Product Cordial, and some special cases of k - product Cordial labelings. A graph  is said to be a Total Edge Product Cordial graph if an edge labeling function  induces a vertex labeling function  defined as the product of the labels of all the edges incident upon that vertex; and satisfying the condition . Also, a graph is called a k-product Cordial graph if a vertex labeling function  induces an edge labeling function  which defines the labeling of an edge as the product of the labels of the vertices  and ; modulo  satisfying the conditions and , where .

AMS Subject Classification. 05C78

Author Biographies

Mahadityasinh Sarvaiya

Research Scholar, R. K. University, Rajkot – 360020, India

Mahesh Parsania

Head, Department of Mathematics, R. K. University, Rajkot – 360020, India

References

1. Barasara, C. M. (2020). Edge product cordial and total edge product cordial labeling of some wheel related graphs. In Recent Advancements in Graph Theory (pp. 57-73). CRC Press.
2. Gadhiya, J. A., Khunti, S. S., & Rupani, M. P. (2020). Product cordial labeling of hypercube related graphs. Malaya Journal of Matematik, 8(04), 1991-1994.
3. Gallian, J. A. (2022). A dynamic survey of graph labeling. Electronic Journal of combinatorics, 6(25), 4-623.
4. Hefnawy, A. I., Elsid, E. A. & Euat Tallah, S. (2018). Cordial labeling for the sum and union of the second power of paths and stars, Util. Math., 108, 283-291.
5. Jesintha, J. J., Devakirubanithi, D., & Charishma, R. (2023). New types of graphs on cordial labeling. Bull. Pure Appl. Sci., Sect. E Math. Stat. E, 42, 36-42.
6. Jeya Daisy, K., Santrin Sabibha, R., Jeyanthi, P., & Youssef, M. Z. (2024). k-Product cordial labeling of product of graphs. Discrete Mathematics, Algorithms and Applications, 16(01), 225-018.
7. Máčajová, E., Mazzuoccolo, G., Mkrtchyan, V., & Zerafa, J. P. (2024). Some Snarks are worse than others. European Journal of Combinatorics, 117, 103832.
8. Sarvaiya Mahadityasinh, Mahesh Parsania and Jekil Gadhiya. "A few results on edge product cordial and total edge product cordial labelings." AIP Conference Proceedings. Vol. 2963. No. 1. AIP Publishing, 2023.
Published
2024-09-20
How to Cite
Mahadityasinh Sarvaiya, & Mahesh Parsania. (2024). Some Results on Cordial Related Labelings of The Flower Snark Graph. Revista Electronica De Veterinaria, 25(1), 1610-1616. Retrieved from https://www.veterinaria.org/index.php/REDVET/article/view/961
Section
Articles