Some cycle-supermagic graphs
Journal: International Journal of Mathematics and Soft Computing (Vol.4, No. 2)Publication Date: 2014.07.13
Authors : N.T Muthuraja; P Jeyanthi;
Page : 137-144
Keywords : Total labeling; H-magic; H-covering; H- supermagic covering.;
Abstract
A simple graph G = (V;E) admits an H-covering if every edge in E belongs to a subgraph of G isomorphic to H. G is H-magic if there is a total labeling f : V [ E ! f1; 2; 3; _ _ _ ; jV j + jEjg such that for each subgraph H0 = (V 0;E0) of G isomorphic to H, P v2V1 f(v) + P e2E1 f(e) = s is constant. When f(V ) = f1; 2; _ _ _ ; jV jg, then G is said to be H-supermagic. In this paper, we show that Pm;n and the splitting graph of a cycle Cn are cycle-supermagic.
Other Latest Articles
- Laparotomy Wound Recurrence of Endometrioid Tumor
- Total edge Fibonacci - like sequence irregular labeling
- Early Prenatal Diagnosis of Isolated Anal Atresia via Ultrasound and Fetal MRI
- B-Chromatic number of some cycle related graphs
- Corpus Luteal Hemorrhage in Coagulopathy; A Case Report with Review of Treatment Modalities
Last modified: 2017-08-29 19:21:55