International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
Volume 79 - Issue 13 |
Published: October 2013 |
Authors: T. Tharmaraj, P. B. Sarasija |
![]() |
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
@article{ 10.5120/13802-1807, author = { T. Tharmaraj,P. B. Sarasija }, title = { On Beta Combination Labeling Graphs }, journal = { International Journal of Computer Applications }, year = { 2013 }, volume = { 79 }, number = { 13 }, pages = { 26-29 }, doi = { 10.5120/13802-1807 }, publisher = { Foundation of Computer Science (FCS), NY, USA } }
%0 Journal Article %D 2013 %A T. Tharmaraj %A P. B. Sarasija %T On Beta Combination Labeling Graphs%T %J International Journal of Computer Applications %V 79 %N 13 %P 26-29 %R 10.5120/13802-1807 %I Foundation of Computer Science (FCS), NY, USA
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.