International Journal of Computer Applications |
Foundation of Computer Science (FCS), NY, USA |
Volume 79 - Number 13 |
Year of Publication: 2013 |
Authors: T. Tharmaraj, P. B. Sarasija |
10.5120/13802-1807 |
T. Tharmaraj, P. B. Sarasija . On Beta Combination Labeling Graphs. International Journal of Computer Applications. 79, 13 ( October 2013), 26-29. DOI=10.5120/13802-1807
Let G(V,E) be a graph with p vertices and q edges. A graph G(p,q) is said to be a Beta combination graph if there exist a bijection f: V(G) ? {1,2 …. , p } such that the induced function Bf: E(G)?N, N is a natural number, given by Bf (uv)= ,every edges uv ? G and are all distinct and the function f is called the Beta combination labeling of G [8]. In this paper, we prove quadrilateral snake Qn,double triangular snake , alternate triangular snake A(Tn), alternate quadrilateral snake A(Qn), helm Hn ,the gear graph,Comb Pn?K1 ,the graph Cn?K1 and the diamond graph are the Beta combination graphs.