Relationship between adjacency matrices and super (a,d)-edge-antimagic-total labeling of graphs

zbMATH Open1100.05087MaRDI QIDQ5488276FDOQ5488276

Authors: Mirka Miller, K. A. Sugeng 

Publication date: 14 September 2006

Recommendations

• Construction of new larger \((a,d)\)-edge antimagic, vertex graphs by using adjacency matrices
• Super \((a,d)\)-edge antimagic total labeling of some classes of graphs
• Expansion techniques on the super edge antimagic total graphs
• Super \((a, d)\)-edge antimagic total labelings of friendship graphs
• Super \((a,d)\)-edge antimagic total labelings of friendship and generalized friendship graphs

zbMATH Keywords

EAV graphedge-antimagic-vertexSEAT graph

Mathematics Subject Classification ID

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

Cited In (3)

• Algorithms for computing parameters of graph-based extensions of BCH codes
• Construction of new larger \((a,d)\)-edge antimagic, vertex graphs by using adjacency matrices
• On consecutive edge magic total labeling of graphs

This page was built for publication: Relationship between adjacency matrices and super \((a,d)\)-edge-antimagic-total labeling of graphs

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