ANTI – MAGIC LABELING ON SOME STAR RELATED GRAPHS.
Abstract
Let G= (V,E) be a simple, finite, undirected and connected graph. A graph G= (V,E) with order p and size q is said to admit anti- magic labelling if there exists a bijection f:E(G) →{1,2,...q} such that for each u,v ϵ V(G) , ∑ f(e) are distinct for all e= uv ϵ E(G).
In this paper , we have obtained anti- magic labelling on the graphs, obtained by joining apex vertices of some star graphs to a new vertex by assigning both even and odd positive integers to these vertices and edges respectively.
In this paper , we have obtained anti- magic labelling on the graphs, obtained by joining apex vertices of some star graphs to a new vertex by assigning both even and odd positive integers to these vertices and edges respectively.
Keywords
Star graphs, Edge labelling, vertex labelling, Even Anti – magic labelling, Odd Anti- magic labelling.
Full Text:
UntitledDOI: https://doi.org/10.26483/ijarcs.v8i6.4334
Refbacks
- There are currently no refbacks.
Copyright (c) 2017 International Journal of Advanced Research in Computer Science

