Cordiality of Transformation Graphs of Path
Abstract views: 49 / PDF downloads: 49
Keywords:
Total Graph, Transformation Graph, Cordial GraphsAbstract
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
How to Cite
Issue
Section
License
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.