Prime Cordial Labeling of Contact Networks: An Environmental Application to Epidemic Spread in Aquatic Populations
Main Article Content
Abstract
A prime cordial labeling of a graph G is a bijection f:V(G)→{1,2,…,|V(G)|} such that each edge uv∈E(G) is assigned label 1 if gcd(f(u),f(v))=1 and 0 if gcd(f(u),f(v))>1; further the number of edges labeled 0 and 1 differ by at most 1. If a graph admits prime cordial labeling, then it is called a prime cordial graph. We prove that the Durer graph, Heawood graph, Frucht graph, Tietze graph, hypohamiltonian graph, cubic graph with 12 vertices, and crown graph are prime cordial graphs. Also we prove that the Herschel graph, Wagner graph, Moser spindle graph, and truncated tetrahedron graph are not prime cordial graphs.
Article Details
Section
How to Cite
References
1. Abdullah Aljouiee. On prime cordial labeling of graphs. Kyungpook Mathematical Journal, 56(1):41–46, 2016.
2. J. Baskar Babujee and L. Shobana. Prime and prime cordial labeling for some special graphs. International Journal of Contemporary Mathematical Sciences, 2010.
3. Cahit. Cordial graphs: A weaker version of graceful and harmonious graphs. Ars Combinatoria, 23:201–207, 1987.
4. Solomon W. Golomb. How to number a graph. In Graph Theory and Computing, pages 23–37. Academic Press, New York, 1972.
5. Ronald L. Graham and Neil J. A. Sloane. On additive bases and harmonious graphs. SIAM Journal on Algebraic and Discrete Methods, 1:382–404, 1980.
6. Frank Harary. Graph Theory. Addison-Wesley, Reading, Massachusetts, 1972.
7. Q. D. Kang, Z. H. Liang, Y. Z. Gao, and G. H. Yang. On labeling of some graphs. Journal of Combinatorial Mathematics and Combinatorial Computing, 22:193–210, 1996.
8. S. Lo. On edge graceful labelings of graphs. Congressus Numerantium, 50:231–241, 1985.
9. Muhammad Naeem, Sehrsih Waseem, Shahid Qaisar, Junaid Ahmad, and Muhammad Kamran Siddiqui. On prime cordial labeling to pattern recognition of knight graphs. Discrete Mathematics, Algorithms and Applications, 2025. Article No. 2550172.
10. Parthiban and Vishally Sharma. A comprehensive survey on prime cordial and divisor cordial labeling of graphs. Journal of Physics: Conference Series, 1531(1):012074, 2020.
11. Alexander Rosa. On certain valuations of the vertices of a graph. In Theory of Graphs (Rome, 1966), pages 349–355. Gordon and Breach, 1967.
A. Sugumaran and V. Mohan. Further results on prime cordial labeling. Annals of Pure and Applied Mathematics, 14(3):489–496, 2017.A. Sugumaran and P. V. Prakash. Prime cordial labeling for theta graph. Annals of Pure and Applied Mathematics, 14(3):379–386, 2017.
12. M. Sundaram, R. Ponraj, and S. Somasundaram. Prime cordial labeling of graphs. Journal of the Indian Academy of Mathematics, 27:373–390, 2005.
13. S. K. Vaidya and N. H. Shah. Some new results on prime cordial labeling. ISRN Combinatorics, 2014.