1. Computing Antimagic Labeling of Lattically Designed Symmetric Networks
2. R. E. L. Aldred and Brendan D . McKay . 1998 . Graceful and harmonious labellings of trees. Bulletin of the Institute of Combinatorics and its Applications 23 (1998), 69--72. R. E. L. Aldred and Brendan D. McKay. 1998. Graceful and harmonious labellings of trees. Bulletin of the Institute of Combinatorics and its Applications 23 (1998), 69--72.
3. Dense graphs are antimagic
4. Martin Bača , Mirka Miller , Joe Ryan , and Andrea Semaničová-Feňovčíková . 2019. Magic and Antimagic Graphs: Attributes, Observations and Challenges in Graph Labelings . Springer . Martin Bača, Mirka Miller, Joe Ryan, and Andrea Semaničová-Feňovčíková. 2019. Magic and Antimagic Graphs: Attributes, Observations and Challenges in Graph Labelings. Springer.
5. Nana Cabo Bizet , Cesar Damian , Oscar Loaiza-Brito , Damián Kaloni Mayorga Peña, and J. A. Montañez-Barrera . 2020 . Testing Swampland Conjectures with Machine Learning . https://doi.org/10.48550/ARXIV.2006.07290 10.48550/ARXIV.2006.07290 Nana Cabo Bizet, Cesar Damian, Oscar Loaiza-Brito, Damián Kaloni Mayorga Peña, and J. A. Montañez-Barrera. 2020. Testing Swampland Conjectures with Machine Learning. https://doi.org/10.48550/ARXIV.2006.07290