ResearchBib Share Your Research, Maximize Your Social Impacts
Sign for Notice Everyday Sign up >> Login

Some Results on Prime Cordial Labeling of Graphs

Journal: International Journal of Advanced Scientific Research & Development (IJASRD) (Vol.03, No. 04)

Publication Date:

Authors : ; ;

Page : 13-19

Keywords : Labeling; Prime Cordial Labeling; Ternary X-Tree.;

Source : Downloadexternal Find it from : Google Scholarexternal

Abstract

A Prime Cordial labeling of a graph with the vertex set is a bijection from such that each edge is assigned the label, if and 0 if then the number of edges labeled with 0 and the number of edges labeled with 1 differ by atmost 1. A graph which admits a prime cordial labeling is called a prime cordial graph. In this paper, we prove that the ternary-tree and, are prime cordial.

Last modified: 2019-02-11 03:41:50