Generation of anti-magic graphs from binary graph products

DOI10.22199/ISSN.0717-6279-5220MaRDI QIDQ6138728zbMATH OpenOpenAlexFDO

Authors 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

anti-magic graphscorona productedge corona productrooted product

Mathematics Subject Classification ID

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

Recommendations

• On anti-magic labeling for graph products
• Anti-magic labeling of trees
• Anti-magic labelling of Cartesian product of graphs
• Antimagic labeling of regular graphs
• Antimagic labeling of new classes of trees

Cites work

• A dynamic survey of graph labeling
• A new graph product and its spectrum
• Anti-magic labeling of trees
• Antimagic labeling of cubic graphs
• Dense graphs are antimagic
• scientific article; zbMATH DE number 6537750 (Why is no real title available?)
• scientific article; zbMATH DE number 47933 (Why is no real title available?)
• Introduction to algorithms
• On the corona of two graphs
• On zero-sum partitions and anti-magic trees
• Regular graphs of odd degree are antimagic
• The spectrum of the edge corona of two graphs

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

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