3-Equitable Prime Cordial Labeling of Middle Graph of Different Graphs

J. P.Jena; G. V. Ghodasara

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

International Journal of Mathematics Trends and Technology

Research Article | Open Access | Download PDF

Volume 57 | Number 4 | Year 2018 | Article Id. IJMTT-V57P533 | DOI : https://doi.org/10.14445/22315373/IJMTT-V57P533

3-Equitable Prime Cordial Labeling of Middle Graph of Different Graphs

J. P.Jena, G. V. Ghodasara

Abstract

In this paper we discuss 3-equitable prime cordial labeling of middle graph of cycle, cycle with one chord, path and tadpole.

Keywords

Middle graph, cycle, path, 3-equitable prime cordial graph.

References

[1] D. M. Burton, Elementary Number Theory (Sixth edition), Tata McGraw-Hill, (2006).
[2] J. Gross and J. Yellen, Graph Theory and its Applications, CRC Press, 1999.
[3] J. A. Gallian, A dynamic survey of graph labeling, The Electronics Journal of Combinatorics, December 22 (2017),pp. 1-415.
[4] J. P. Jena and G. V. Ghodasara, “3-equitable prime cordial labeling of different graphs”, International Journal of Mathematics and Soft Computing, 7(2), 2017.
[5] S. Murugesan, D. Jayaraman and J. Shiama,“3-equitable prime cordial labeling of graphs”, International Journal of Applied Information Systems, 5(9), 2013.
[6] Dr. Sweta Srivastav and Dr. Sangeeta Gupta, “3-equitable prime cordial labeling of some graphs”, International Journal of Engineering Research, 4(3), 2015.

Citation :

J. P.Jena, G. V. Ghodasara, "3-Equitable Prime Cordial Labeling of Middle Graph of Different Graphs," International Journal of Mathematics Trends and Technology (IJMTT), vol. 57, no. 4, pp. 231-242, 2018. Crossref, https://doi.org/10.14445/22315373/IJMTT-V57P533