Generation of anti-magic graphs from binary graph products

DOI10.22199/issn.0717-6279-5220OpenAlexW4376111582MaRDI QIDQ6138728

P. Ragukumar

Publication date: 16 January 2024

Published in: Proyecciones (Antofagasta) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.22199/issn.0717-6279-5220

zbMATH Keywords

corona productrooted productanti-magic graphsedge corona product

Mathematics Subject Classification ID

Trees (05C05) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Anti-magic labeling of trees
• On zero-sum partitions and anti-magic trees
• A dynamic survey of graph labeling
• On the corona of two graphs
• Antimagic Labeling of Cubic Graphs
• Regular Graphs of Odd Degree Are Antimagic
• The spectrum of the edge corona of two graphs
• Dense graphs are antimagic
• A new graph product and its spectrum

This page was built for publication: Generation of anti-magic graphs from binary graph products