Cube Difference Labeling of Theta Graphs

Jagadeeswari. P., Manimekalai K., Ramanathan. K.1

1

Publication Date: 2019/07/17

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.

DOI: No DOI Available

PDF: https://ijirst.demo4.arinfotech.co/https://ijisrt.com/wp-content/uploads/2019/06/IJISRT19MY273.pdf

REFERENCES

No References Available