Some Contribution to Graph Labelling and Special Graph Theory
Loading...
Date
item.page.authors
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
A graphical label is an assignment of the integral elements to vertices or edges. The issue of the graph labelling that has lately developed quickly in graph theory. This is not only because of the mathematical importance, but because of the wide range of applications that arise from the field, such as x-rays, crystallography, coding theory, radar, astronomy, the design of circuits and the design of good Radar type codes, misile guidance codes and Convolution codes with optimized communication and auto correlations. In the past five decades, there has been a huge amount of writing surrounding this topic. Families of graphs with lovely names like graceful, harmonic, happy, elegant, cordial, additive and#119896;-sequentially, magic, bi-magic, pair-sum, anti-magic, primallabels, etc. have been created. The one recently published by J.A.Gallian is a helpful overview to know about the several techniques of graph labelling. In 1983, the concept of ksequentially additive labeling of graph was introduced and studied by Bange, Barkauskas, and Slater. A k-sequentially additive labeling of a graph G (V, E) is defined as abijection f from VE to {k, k+1, , k+|VE| 1} such that for each edge xy E, f (xy)=f (x) + f (y). Ifk=1,thenG(V,E)issaidtobe1- sequentially additive graph or a simply sequentially additive graph or briefly, an SSA-graph. Bange, Barkauskas, and Slater proved the following results: Knis1-sequentiallyadditiveifand only if n 3; C3n+1 is not k- sequentially additive for k 0 or 2 (mod 3); C3n+2 is not k-sequentially additive for k 1 or 2 (mod3); the cycle Cnis 1-sequentially additive if and only if n 0,1(mod3) and the path Pnis 1-sequentially additive. Also they [6] conjectured that all trees are 1-sequentially additive. Hegde and Miller proved thatK1,nis k-sequentially additive if and only if k divides n.