Share Your Research, Maximize Your Social Impacts
Cordial labeling for some bistar related graphs
Journal: International Journal of Mathematics and Soft Computing (Vol.4, No. 2)Publication Date: 2014.07.13
Authors : S K Vaidya; N H Shah;
Page : 33-39
Keywords : Cordial labeling; square graph; shadow graph; splitting graph; degree splitting graph;
Source : Download
Find it from : Google Scholar
Abstract
In this paper we prove that square graph and shadow graph of bistar admit cordial labeling. Moreover we prove that splitting graph of bistar as well as degree splitting graph of bistar are cordial graphs.
Other Latest Articles
- Elsberg Syndrome in Pregnancy: A Case of Acute Urinary Retention Due to Sacral Myeloradiculitis Resulting From a Recurrent Herpes Simplex Virus-2 Infection
- Stability of a quartic and additive functional equation in 2-banach space
- Sigmoid Volvulus Presenting During Late Pregnancy: A Report of Two Cases from a Single Institution
- Prevalence of HPV and Type Distribution in Southeast Asian Women Residing in Rhode Island
- On skolem difference mean labeling of some trees
Last modified: 2017-08-30 19:09:55