On local antimagic chromatic number of cycle-related join graphs. II
From MaRDI portal
Publication:6560771
DOI10.1142/S1793830923500222zbMATH Open1541.05153MaRDI QIDQ6560771
K. Premalatha, S. Arumugam, Wai Chee Shiu, Gee-Choon Lau
Publication date: 24 June 2024
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Cites Work
- Title not available (Why is that?)
- Local antimagic vertex coloring of a graph
- On local antimagic chromatic number of cycle-related join graphs
- Affirmative solutions on local antimagic chromatic number
- Graphs of large linear size are antimagic
- Construction of magic rectangles of odd order
- Regular Graphs of Odd Degree Are Antimagic
- Dense graphs are antimagic
- Antimagic Labeling of Regular Graphs
- Regular bipartite graphs are antimagic
- On a combination of the 1-2-3 Conjecture and the Antimagic Labelling Conjecture
- Proof of a local antimagic conjecture
- Nearly magic rectangles
This page was built for publication: On local antimagic chromatic number of cycle-related join graphs. II
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6560771)