Cube Difference Labeling of Star Related Graphs
Keywords:
Cube difference labeling, Cycle, Merge graph, bistars and the subdivision of the edges of the stars graph K_(1,n) .Abstract
Let G = (V(G),E(G)) be a graph. G is said to be cube difference labeling if there exist a injection f:V(G)→{0,1,2,…,p-1} such that the induced function f^*:E(G)→N given by f^* (uv)=|[f(u)]?^3-?[f(v)]^3 | is injective. A graph which satisfies the cube difference labeling is called the cube difference graph. The cube difference labeling of merge graph (C_3*K_(1,n)), Bistars and the subdivision of the edges of the star graph K_(1,n ) are discussed in this paper.
References
- J.A. Bondy. and U.S.R. Murthy, Graph Theory with applications, North Holland Elsevier (1976), New York.
- Joseph A. Gallian, (2015), A Dynamic survey of Graph Labeling.
- N. Murugesan and R. Uma, (2015), Super vertex Gracefulness of some special graphs, IOSR Journal of Mathematics, ISSN 2278-5728.
- J. Shiama, (2013), Cube difference labeling of some graphs, IJESIT, ISSN 2319-5967.
- A. Solairaju, and R. Raziya Begum, (2012), Edge-Magic labeling of some graphs, International Journal of Fuzzy Mathematics and Systems, ISSN 2248-9940.
- Sunny Joseph Kalayathankal and Susanth C, (2014), The Sum and Product of Chromatic Number of Graphs and their Line Graphs.
- T. Tharmaraj and P. B. Sarasija., (2015), Some square graceful graphs, International Journal of Mathematics and Soft Computing, ISSN 2319-5215.
Downloads
Published
Issue
Section
License
Copyright (c) IJSRCSEIT

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