Some Results on Prime Cordial Labeling of Graphs
Journal: International Journal of Advanced Scientific Research & Development (IJASRD) (Vol.03, No. 04)Publication Date: 2016-12-30
Authors : S. Meena; A. Archunan;
Page : 13-19
Keywords : Labeling; Prime Cordial Labeling; Ternary X-Tree.;
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.
Other Latest Articles
- Techniques for the Computerized Storage of Cadastral Data in Databases
- Causes and Effects of the Dwindled State of the Ghana Textile Industry
- The Position of Abandoned Heating Plants Inside the Urban Lanscape
- Aspects Regarding Side Displacement and Deformation as Effect of the Subsidence Process Caused by the Exploitation of Mineral Underground Deposite
- Use of Digital Terrain Modelling in Calculation of Stone Quarry Volumes to Renew the Exploitation Permit
Last modified: 2019-02-11 03:41:50