Construction of new larger (a,d)-edge antimagic, vertex graphs by using adjacency matrices

zbMATH Open1274.05428MaRDI QIDQ2848745FDOQ2848745

Authors: S. Rahmawati, D. R. Silaban, Mirka Miller, Martin Bača, K. A. Sugeng 

Publication date: 26 September 2013

Published in: The Australasian Journal of Combinatorics (Search for Journal in Brave)

Recommendations

• Relationship between adjacency matrices and super \((a,d)\)-edge-antimagic-total labeling of graphs
• New constructions of magic and antimagic graph labelings
• Super \((a, d)\)-edge antimagic total labelings of friendship graphs
• Edge-antimagic graphs
• Expansion techniques on the super edge antimagic total graphs

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cited In (2)

• Relationship between adjacency matrices and super \((a,d)\)-edge-antimagic-total labeling of graphs
• Title not available (Why is that?)

This page was built for publication: Construction of new larger \((a,d)\)-edge antimagic, vertex graphs by using adjacency matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2848745)