On Beta Combination Labeling Graphs
T. Tharmaraj, P. B. Sarasija · International Journal of Computer Applications · 2013
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)= f(v)! f(u)! f(v)]! + [f(u) ,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. General Terms Mathematical subject classification (2010) 05C78.