Cube Difference Labeling of Theta Graphs


Authors : Jagadeeswari. P., Manimekalai K., Ramanathan. K.

Volume/Issue : Volume 4 - 2019, Issue 5 - May

Google Scholar : https://goo.gl/DF9R4u

Scribd : https://bit.ly/2K4RL5d

Abstract : In this work, we prove that the theta graph (Tα), Duplication of any vertex of degree 3 in Tα, path union of r copies of Tα, one point union of r(Tα), the fusion of any two vertices of Tα, switching of a central vertex in Tα are Cube difference labeling.

Keywords : Cube Difference Labeling (CDL), Fusion, Duplication, Switching, Path Union, One Point Union. AMS Subject Classification: 0578.

In this work, we prove that the theta graph (Tα), Duplication of any vertex of degree 3 in Tα, path union of r copies of Tα, one point union of r(Tα), the fusion of any two vertices of Tα, switching of a central vertex in Tα are Cube difference labeling.

Keywords : Cube Difference Labeling (CDL), Fusion, Duplication, Switching, Path Union, One Point Union. AMS Subject Classification: 0578.

Video Explanation for Published paper

Never miss an update from Papermashup

Get notified about the latest tutorials and downloads.

Subscribe by Email

Get alerts directly into your inbox after each post and stay updated.
Subscribe
OR

Subscribe by RSS

Add our RSS to your feedreader to get regular updates from us.
Subscribe