A study on (a,d)-antimagic graphs using partition

zbMATH Open1364.05060MaRDI QIDQ3166170FDOQ3166170

Authors: V. Vilfred, L. Mary Florida 

Publication date: 21 October 2012

Recommendations

• On \((a,d)\)-antimagic special trees, unicyclic graphs and complete bipartite graphs.
• Further results on antimagic graph labelings
• A note on \((a,d)\)-vertex antimagic total labeling of paths and cycles
• \((a,d)\)-distance antimagic labeling of some types of graphs
• On \((a,d)\)-antimagic prisms

zbMATH Keywords

partitiondegree sequenceantimagic labelingantimagic graph(a,d)-antimagic graph(a,d)-antimagic labeling

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cited In (5)

• On \((a,d)\)-antimagic special trees, unicyclic graphs and complete bipartite graphs.
• On \(d\)-row (column) antimagic matrices and subset partitions
• Title not available (Why is that?)
• \((a,d)\)-distance antimagic labeling of some types of graphs
• Antitwins in partitionable graphs

This page was built for publication: A study on \((a,d)\)-antimagic graphs using partition

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