A graph labeling is a mapping that carries a set of graph elements onto a set of numbers called labels (usually the set of integers). In this paper we prove the existence of graph labeling such as cordial, total cordial, product cordial, total product cordial, prime cordial, odd...
Open access
Research Article10.9734/BJAST/2016/29134
A graph labeling is a mapping that carries a set of graph elements onto a set of numbers called labels (usually the set of integers). In this paper we prove the existence of graph labeling such as E- cordial, total E- cordial, product E-cordial, total product E-cordial, Prime E-...
Open access
Research Article10.9734/BJMCS/2016/29083
In this paper, we introduce a new method of construction called H-super subdivision of graphs and prove that the H-super subdivision of Y -tree Yn+1 (n ≥ 2) is graceful and there by answering the open question posed in 2009 by Arumugam and others [1]. Also we prove that the H-sup...
Open access
Research Article10.9734/BJAST/2016/29082