Learn More
Let C = (M, N) be a finite, undirected and simple graph with |M (C)| = t and |N (C)| = s. The labeling of a particular graph is a function which maps vertices and edges of graph or both into numbers (generally +ve integers). If the domain of the given graph is the vertex-set then the labeling is described as a vertex labeling and if the domain of the given(More)
Enomoto, Llado, Nakamigawa and Ringel (1998) defined the concept of a super (a, 0)-edge-antimagic total labeling and proposed the conjecture that every tree is a super (a, 0)-edge-antimagic total graph. In the support of this conjecture, the present paper deals with different results on super (a, d)-edge-antimagic total labeling of subdivided stars for d ∈(More)
Enomoto et al. (1998) defined the concept of a super ,0) (a-edge-antimagic total labeling and proposed the conjecture that every tree is a super ,0) (a-edge-antimagic total graph. In the favour of this conjecture, the present paper deals with different results on antimagicness of a class of trees, which is called subdivided stars. 1 INTRODUCTION All graphs(More)