On Edge Magic Total Labeling of (7, 3)-Cycle Books

A graph G is called (a, b)-cycle books B[(Ca, m), (Cb, n), Pt] if G consists of m cycles Ca and n cycles Cb with a common path Pt. In this article we show that the (7, 3)-cycle books B[(C7, 1), (C3, n), P2] admits edge-magic total labeling. In addition we prove that (a, 3)-cycle books B[(Ca, 1), (C3...

Full description

Bibliographic Details
Main Authors: Baki Swita, Ulfasari Rafflesia, Nova Henni Ms, Dolly Stio Adji, Mudin Simanihuruk
Format: Article
Language:English
Published: Hindawi Limited 2019-01-01
Series:International Journal of Mathematics and Mathematical Sciences
Online Access:http://dx.doi.org/10.1155/2019/1801925