Duplicating a Vertex with an Edge in Divided Square Difference Cordial Graphs

  • A. Alfred Leo 1Research Scholar, Research and Development Centre, Bharathiar University, Coimbatore-641 046, Tamil Nadu, India.
  • R Vikramaprasad Assistant Professor, Department of Mathematics, Government Arts College, Salem-636 007, Tamil Nadu, India.
Keywords: duplication of a vertex by an edge, path, cycle graph, star graph, wheel graph, helm graph, crown graph, comb graph, snake graph

Abstract

In this present work, we discuss divided square difference (DSD) cordial labeling in the context of duplicating a vertex with an edge in DSD cordial graphs such as path graph, cycle graph, star graph, wheel graph, helm graph, crown graph, comb graph and snake graph.

Downloads

Download data is not yet available.

References

Leo A. A., Vikramaprasad R. and Dhavaseelan R. (2018). Divided square difference cordial labeling graphs, International Journal of Mechanical Engineering and Technology, 9(1), 1137–1144.

Leo A.A. and Vikramaprasad R. (2018). Divided square difference cordial labeling of some special graphs, International Journal of Engineering and Technology, 7(2), 935–938.

Leo A.A. and Vikramaprasad R. (2018). More results on divided square difference cordial graphs,International Journal of Scientific Research and Review, 7(5), 380–385.

Leo A. A. and Vikramaprasad R. (2018). Path related balanced divided square difference cordial graphs, International Journal of Computer Sciences and Engineering, 6(6), 727–731.

Cahit I. (1987). “Cordial graphs: a weaker version of graceful and harmonious graphs,” Ars Combinatoria, 23,201–207.

Dhavaseelan R., Vikramaprasad R. and Abhirami S. (2015). A new notions of cordial labeling graphs, Global Journal of Pure and Applied Mathematics, 11(4), 1767–1774.

Gallian J. A. (2008). A dynamic survey of graph labeling, Electronic J. Combin. 15, DS6,1–190.

Harary F. (1969). Graph theory, Addison-Wesley, Reading, MA.

Kaneria V. J., Patadiya Kalpesh M. and Jeydev R. (2016). Teraiya, Balanced cordial labeling and its applications to produce new cordial families, International Journal of Mathematics and its Applications, 4(1-C), 65–68.

Rosa A. (1967). On certain valuations of the vertices of a graph, Theory of Graphs (International Symposium, Rome, July 1966), Gordon and Breach, N. Y. and Dunod Paris 349–355.

Varatharajan R., Navaneethakrishnan S. and Nagarajan K. (2011). Divisor cordial graphs, International J. Math. Combin, 4, 15–25.

Vaidya S. K. and Barasara C. M. (2012). Harmonic mean labeling in the context of duplication of graph elements, ElixirDiscrete Mathematics, 48,9482–9485.

Published
2018-09-06
How to Cite
A. Alfred Leo, & R Vikramaprasad. (2018). Duplicating a Vertex with an Edge in Divided Square Difference Cordial Graphs. Mathematical Journal of Interdisciplinary Sciences, 7(1), 1-8. Retrieved from https://mjis.chitkara.edu.in/index.php/mjis/article/view/45
Section
Articles