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

Baki Swita, Ulfasari Rafflesia, Nova Henni Ms, Dolly Stio Adji and Mudin Simanihuruk

International Journal of Mathematics and Mathematical Sciences, 2019, vol. 2019, 1-8

Abstract:

A graph G is called ( a, b )- cycle books B [( C a , m ) , ( C b , n ) , P t ] if G consists of m cycles C a and n cycles C b with a common path P t . In this article we show that the (7 , 3)-cycle books B [( C 7 , 1) , ( C 3 , n ) , P 2 ] admits edge-magic total labeling. In addition we prove that ( a, 3)-cycle books B [( C a , 1) , ( C 3 , n ) , P 2 ] admits super edge-magic total labeling for a = 7 and extends the values of a to 4 x − 1 for any positive integer x . Moreover we prove that the (7, 3)-cycle books B [( C 7 , 2) , ( C 3 , n ) , P 2 ] admits super edge-magic total labeling.

Date: 2019
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/IJMMS/2019/1801925.pdf (application/pdf)
http://downloads.hindawi.com/journals/IJMMS/2019/1801925.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jijmms:1801925

DOI: 10.1155/2019/1801925

Access Statistics for this article

More articles in International Journal of Mathematics and Mathematical Sciences from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().