On Degree Cordial Labelings of Certain Families of Graphs

Samina Boxwala; Aditi S. Phadke; Nilesh Mundlik; Pramod N. Shinde

doi:https://doi.org/10.14445/22315373/IJMTT-V69I2P511

International Journal of Mathematics Trends and Technology

Research Article | Open Access | Download PDF

Volume 69 | Issue 2 | Year 2023 | Article Id. IJMTT-V69I2P511 | DOI : https://doi.org/10.14445/22315373/IJMTT-V69I2P511

On Degree Cordial Labelings of Certain Families of Graphs

Samina Boxwala, Aditi S. Phadke, Nilesh Mundlik, Pramod N. Shinde

Received	Revised	Accepted	Published
03 Jan 2023	04 Feb 2023	16 Feb 2023	28 Feb 2023

Abstract

In this paper, we define a new graph labeling called Degree Cordial labeling and call a graph Degree Cordial if it admits a Degree Cordial labeling. Let G = (V, E) be a graph and let f : E -> {0, 1} be a function. We call f a Degree Cordial labeling if for each vertex v ε V, the number of edges incident on v with edge lable 0 and 1 differ by atmost 1. Here we discuss Degree Cordial labeling for the following graphs: Paths, Cycles, Wheel graphs, Helms, Closed Helms, Generalised Webs, Flower, Sunflower, Combs, Complete Bipartite graph and some Complete graphs.

Keywords

Paths, Cycles, Wheels, Helms, Webs, Flower Graphs, Combs, Complete Bipartite, New Graph Labeling.

References

[1] Andar M., Boxwala S., Limaye N. B., A Note on Cordial Labelings of Multiple Shells, Number Theory and Discrete Mathematics, Trends in Mathematics, Birkh¨auser, Basel (2002).
[2] Andar M., Boxwala S., Limaye N. B., Cordial labelings of some wheel related graphs, J. of Combin. Math. Combin. Comput. 41 (2002): 203-208.
[3] Andar M., Boxwala S., Limaye N. B., On the cordiality of the t-ply Pt (u, v), Ars Combin., 77 (2005): 245-259.
[4] Andar M., Boxwala S., Limaye N. B., On the cordiality of corona graphs, Ars Combin., 78 (2006): 179-199.
[5] Andar M., Boxwala S., Limaye N. B., On the cordiality of the t-uniform homeomorphs-I, Ars Combinatoria, 66 (2003): 313-318.
[6] Andar M., Boxwala S., Limaye N. B., On the cordiality of the t-uniform homeomorphs-II (Complete graphs), Ars Combin., 67 (2003): 213-220.
[7] Samina Boxwala, Limaye N. B., On the cordiality of Elongated Plys, J. of Combin. Math. Combin. Comput. 52 (2005): 181-221.
[8] Samina Boxwala, Aditi S. Phadke, Pramod N. Shinde, On Group A-Cordial Labeling of Uniform t-Ply, International Journal of Mathematics Trends and Technology, vol. 68, no. 7,(2022): 21-25.
[9] Boxwala S., Vashishta P., Some new families of graceful graphs, Electronic Notes in Discrete Mathematics, 48 (2015): 127-133.
[10] Cahit I., Cordial Graphs: a weaker version of graceful and harmonious graphs, Ars Combinatoria, 23 (1987): 201-207.
[11] Chandra, B. and Kala, Rukhmoni. Group S3 cordial prime labeling of graphs, Malaya Journal of Matematik. S. (2019): 403-407.
[12] Chandra, B. and Kala, Rukhmoni. Group S3 Cordial Prime Labeling of Some Graphs,International Journal of Applied Engineering Research,Volume 14, Number 22 (2019): 4203-4208.
[13] Gallian J. A., A Dynamic Survey of Graph Labeling, Electron. J. Combin., DS6. 2019.
[14] Golomb S. W., How to number a graph in Graph Theory and Computing, R. C. Read, ed., Academic Press, New York (1972): 23-37.
[15] Graham R. L., Sloane N. J. A., On additive bases and harmonious graphs, SIAM J. Alg. Discrete Methods, 1 (1980): 382-404.
[16] F. Harary, Graph Theory, Addison Wesley, Reading Mass, (1972).
[17] Hassan, T. and Abbas Prime Graceful Labeling, International Journal of Engineering & Technology, 7 (4.36) (2018): 750-752.
[18] Athisayanathan, S., Ponraj, R. and Karthik Chidambaram, M., K., Group A cordial labeling of Graphs, International Journal of Applied Mathematical Sciences, Vol 10, No.1(2017): 1-11.
[19] Athisayanathan, S., Ponraj, R. and Karthik Chidambaram, M., K., Group {1,−1, i,−i} Cordial labeling of sum of Pn and Kn, Journal of Mathematical and Computational Science, Vol 7, No 2 (2017): 335-346.
[20] M. K. Karthik Chidambaram, S. Athisayanathan and R. Ponraj, Group {1,−1, i,−i} Cordial Labeling of Special Graphs, Palestine Journal of Mathematics Vol. 9(1)(2020): 69-76. ON DEGREE CORDIAL LABELINGS OF CERTAIN FAMILIES OF GRAPHS 11
[21] Ng H. K., Lee S. N., A conjecture on edge cordial trees, Abstracts American Mathematical Society, 9 (1988): 286-287.
[22] Rosa A., On certain valuations of the vertices of a graph, Theory of Graphs (Internat. Symposim, Rome, July 1966), Gordon & Breach, N. Y. and Dunod Paris (1967): 349-355.
[23] Shinde P., Boxwala S., Phadke A., Mundlik N., & Jadhav V. , Product Dimension of Uniform Spider, Palestine Journal of Mathematics, 11(4), (2022): 276-281.
[24] A. Tout, A. N. Dabboucy and K. Howalla, Prime Labeling of graphs, National Academy Science Letters, 11 pp. (2022): 365–368.
[25] Yilmaz R, Cahit I., E cordial graphs, Ars Combin., 46, (1997): 251-266.

Citation :

Samina Boxwala, Aditi S. Phadke, Nilesh Mundlik, Pramod N. Shinde, "On Degree Cordial Labelings of Certain Families of Graphs," International Journal of Mathematics Trends and Technology (IJMTT), vol. 69, no. 2, pp. 80-90, 2023. Crossref, https://doi.org/10.14445/22315373/IJMTT-V69I2P511