Cordiality of Transformation Graphs of Path


Abstract views: 89 / PDF downloads: 79

Authors

  • S. B. Chandrakala Department of Mathematics, Nitte Meenakshi Institute of Technology, Bangalore, Karnataka, India
  • K. Manjula Department of Mathematics, Bangalore Institute of Technology, Bangalore, Karnataka, India
  • B. Sooryanarayana Department of Mathematics, Dr. Ambedkar Institute of Technology, Bangalore, Karnataka, India

Keywords:

Total Graph, Transformation Graph, Cordial Graphs

Abstract

A graph is said to be cordial if it has a 0-1 vertex labeling that satisfies certain properties. In this paper we show that transformation graphs of path are cordial.

Downloads

Published

15-09-2019

How to Cite

S. B. Chandrakala, K. Manjula, & B. Sooryanarayana. (2019). Cordiality of Transformation Graphs of Path. International Journal of Mathematics And Its Applications, 7(3), 11–21. Retrieved from https://ijmaa.in/index.php/ijmaa/article/view/224

Issue

Vol. 7 No. 3 (2019)

Section

Research Article

License

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.