期刊名称：International Journal of Mathematics and Mathematical Sciences
印刷版ISSN：0161-1712
电子版ISSN：1687-0425
出版年度：2019
卷号：2019
DOI：10.1155/2019/1801925
出版社：Hindawi Publishing Corporation
摘要：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, n), P2] admits super edge-magic total labeling for a = 7 and extends the values of a to 4x − 1 for any positive integer x. Moreover we prove that the (7, 3)-cycle books B[(C7, 2), (C3, n), P2] admits super edge-magic total labeling.
Loading...
