The week's pick
Reseach Article
Beta Combination Graphs
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 76 - Number 14 |
| Year of Publication: 2013 |
| Authors: T. Tharmaraj, P. B. Sarasija |
10.5120/13312-0589
|
T. Tharmaraj, P. B. Sarasija . Beta Combination Graphs. International Journal of Computer Applications. 76, 14 ( August 2013), 1-5. DOI=10.5120/13312-0589
Abstract
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. In this paper, we proved the Petersen graph , Complete graph Kn (n? 8),Ladder Ln (n 2), fan fn (n? 2), wheel Wn(n? 3), path Pn , cycle Cn(n?3),friendship graph Fn (n?1),complete bipartite graph Kn,n (n? 2), Tree Tn , triangle snake , n-bistar graph Bn,n and Star graph K1,n (n>1) are the Beta combination graphs. Also we proved Complete graph Kn (n>8) is not a Beta combination graph.
References
- B. D. Acharya and S. M. Hegde,Arithmetic graphs,J. Graph Theory,14(3)(1990),275-299.
- L. Beineke and S. M. Hegde,Stronly multiplicative graphs,Discuss. Math. Graph Theory, 21(2001),63-75.
- D. M. Burton,Elementary Number Theory,Second Edition,Wm. C. Brown company Publishers,1980.
- J. A. Gallian,A dynamic survey of graph labeling, The Electronic journal of combinatorics,5(2002),# DS6,1-144.
- S. M. Hegde and Sudhakar Shetty,Combinatorial Labelings of Graphs,Applied Mathematics E-Notes, 6(2006),251-258.
- F. Harary, Graph Theory,Addison-Wesley, Reading,Massachusetts,1972.
Index Terms
Keywords