Some New Families of Edge, Face Edge and Total Face Edge Sum Divisor Cordial Graphs

G. Vijayalakshmi; M. Mohamed Sheriff; P. Lawrence Rozario Raj

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

International Journal of Mathematics Trends and Technology

Research Article | Open Access | Download PDF

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

Some New Families of Edge, Face Edge and Total Face Edge Sum Divisor Cordial Graphs

G. Vijayalakshmi, M. Mohamed Sheriff, P. Lawrence Rozario Raj

Received	Revised	Accepted	Published
05 Mar 2023	05 Apr 2023	17 Apr 2023	30 Apr 2023

Abstract

In this paper, we investigate some new families of edge sum divisor cordial graphs, face edge sum divisor cordial graphs and total face edge sum divisor cordial graphs.

Keywords

Edge sum divisor cordial labelling, Edge sum divisor cordial graph, face edge sum divisor cordial graph, total face edge sum divisor cordial graph, switching of any vertex.

References

[1] J.A. Bondy, and U.S.R. Murthy, Graph Theory and Application (North Holland), New York, 1976.
[2] D.M. Burton, Elementary Number Theory, Second Edition, Wm. C. Brown Company Publishers, 1980.
[3] Ibrahim Cahit, “Cordial Graphs: A Weaker Version of Graceful and Harmonious Graphs,” Ars Combinatoria, vol. 23, pp. 201-208, 1987.
[Google Scholar] [Publisher link]
[4] G. Chartrand, and L. Lesniak, Graphs and Digraphs, Third edition, Chapman and Hall/CRC, Florida, 2000.
[Google Scholar]
[5] A. Farhana Abbas, and M. Mohamed Sheriff, “Face Integer Cordial, Face Integer Edge Cordial and Total Face Integer Edge Cordial Graphs,” Journal of Applied Science and Computations, vol. 6, no. 3, pp. 1426-1438, 2019.
[6] Joseph A. Gallian, “A Dynamic Survey of Graph Labeling,” The Electronic Journal of Combinatorics, 2022, #DS6.
[7] S.W. Golomb, “How to Number a Graph,” Graph Theory and Computing, pp. 23-37, 1972.
[CrossRef][Google Scholar] [Publisher link]
[8] F. Harary, Graph Theory, Addison Wesley, Reading, Massachusetts, 1972.
[9] P. Lawrence Rozario Raj, and S. Koilraj, “Cordial Labeling for the Splitting Graph of Some Standard Graphs,” International Journal of Mathematics and Soft Computing, vol. 1, no. 1, pp. 105-114, 2011.
[CrossRef][Google Scholar] [Publisher link]
[10] P. Lawrence Rozario Raj, and R. Lawrence Joseph Manoharan, “Face and Total Face Edge Product Cordial Graphs,” International Journal of Mathematics Trends and Technology, vol. 19, no. 2, pp. 136-149, 2015.
[CrossRef][Google Scholar] [Publisher link]
[11] P. Lawrence Rozario Raj, and R. Lawrence Joseph Manoharan, “Face and Total Face Product Cordial Labeling of Graphs,” International Journal of Innovative Science, Engineering & Technology, vol. 2, no. 9, pp. 93-102, 2015.
[Google Scholar]
[12] A. Lourdusamy, and F. Patrick, “Sum Divisor Cordial Graphs,” Proyecciones Journal of Mathematics, vol. 35, no. 1, pp. 119-136, 2016.
[CrossRef][Google Scholar] [Publisher link]
[13] M. Mohamed Sheriff, A. Farhana Abbas, and P. Lawrence Rozario Raj, “Face Integer Cordial Labeling of Graphs,” International Journal of Mathematics Trends and Technology, vol. 41, no. 2, pp. 177-185, 2017.
[CrossRef][Google Scholar] [Publisher link]
[14] M. Mohamed Sheriff, and A. Farhana Abbas, “A Study on Face Integer Edge Cordial Graphs,” International Journal of Fuzzy Mathematical Archive, vol. 15, no. 2, pp. 209-216, 2018.
[CrossRef][Google Scholar]
[15] M. Mohamed Sheriff, and G. Vijayalakshmi, “Face Sum Divisor Cordial Graphs,” International Journal of Fuzzy Mathematical Archive, vol. 15, no. 2, pp. 197-204, 2018.
[CrossRef][Google Scholar]
[16] M. Mohamed Sheriff, and G. Vijayalakshmi, “Face Sum Divisor Cordial Labeling of Wheel Related Graphs,” The International Journal of Analytical and Experimental Modal Analysis, vol. 11, no. 10, pp. 44-48, 2019.
[17] M. Mohamed Sheriff, and G. Vijayalakshmi, “Face Sum Divisor Cordial Labeling of Cycle Related Graphs,” Journal of Applied Science and Computations, vol. 6, no. 2, pp. 875-881, 2019.
[18] A. Rosa, On certain valuations of the vertices of a graph, Theory of Graphs (Internat. Sympos., Rome, 1966), Gorden and Breach, (1967), N.Y. and Dunod Paris, pp. 349-355, 1967.
[19] E. Sampathkumar, and H.B. Walikar, “On Splitting Graph of a Graph,” J. Karnatak Univ. Sci., 25 and 26 (Combined) (1980-81), pp. 13- 16.
[20] Samir K. Vaidya, and Chirag M. Barasara, “Total Edge Product Cordial Labeling of Graphs,” Malaya Journal of Matematik, vol. 3, no. 1, pp. 55-63, 2013.
[Google Scholar]
[21] R. Varatharajan, S. Navanaeethakrishnan, and K. Nagarajan, “Divisor Cordial Graphs,” International Journal of Mathematical Combinatories, vol. 4, pp. 15-25, 2011.
[Google Scholar]
[22] G. Vijayalakshmi, and M. Mohamed Sheriff, “Total Face Edge Sum Divisor Cordial Graphs,” International Journal of Food and Nutritional Sciences, vol. 11, no. 11, pp. 170-178, 2022.
[23] G. Vijayalakshmi, M. Mohamed Sheriff, and P. Lawrence Rozario Raj, “Edge Sum Divisor Cordial Graphs,” Journal of Otorhinolaryngology and Head and Neck Surgery, vol. 26, no. 2, pp. 407-417, 2022.
[24] G. Vijayalakshmi, and M. Mohamed Sheriff, “Face Edge Sum Divisor Cordial Graphs,” Indian Journal of Natural Sciences, vol. 14, no. 77, pp. 54615-54620, 2023.
[25] Rahime Yilmaz, and Ibrahim Cahit, “E-Cordial Graphs,” Ars Combinatoria, vol. 46, 1997

Citation :

G. Vijayalakshmi, M. Mohamed Sheriff, P. Lawrence Rozario Raj, "Some New Families of Edge, Face Edge and Total Face Edge Sum Divisor Cordial Graphs," International Journal of Mathematics Trends and Technology (IJMTT), vol. 69, no. 4, pp. 54-68, 2023. Crossref, https://doi.org/10.14445/22315373/IJMTT-V69I4P507