References
- Alon, N. 1992. Transmitting in the n-dimensional cube. Discrete Applied Mathematics 37-38: 9–11.
- Barrus, M.D. & J. A. Guillaume. 2022. Upward-closed hereditary families in the dominance order. Discrete Mathematics and Theoretical Computer Science, 23, no. 3.
https://doi.org/10.46298/dmtcs.5666 - Bessy, S., A. Bonato, J. Janssen, D. Rautenbach & E. Roshanbin. 2017. Burning a graph is hard. Discrete Applied Mathematics 232: 73–87.
- Bonato, A. 2021. A survey of graph burning. Contributions to Discrete Mathematics 16(1):13.
- Bonato, A., J. Janssen & E. Roshanbin. 2016. How to burn a graph. Internet Mathematics 12:85–100.
- Chvátal, V. & P. L. Hammer. 1977. Aggregation of inequalities in integer programming. Annals of Discrete Mathematics 1: 145–162.
- Dhanyamol, A., D. Anita, G. Shirish, J. Dalu & K. Shashanka. 2026. Graph Burning: Bounds and Hardness, 2026. arXiv:2402.18984.
https://doi.org/10.48550/arXiv.2402.18984 - Kramer, A.D.I., J. E. Guillory & J.T. Hancock. 2014. Experimental evidence of massive scale emotional contagion through social networks. Proceedings of the National Academy of Sciences 111: 8788–8790.
- Travers, J. & S. Milgram. 1969. An experimental study of the small world problem. Sociometry 32: 425–443.
- West, D.B. 2015. Introduction to graph theory. second edition. New York: Pearson.
DOI: https://doi.org/10.21307/joss-2026-003 | Journal eISSN: 1529-1227
Language: English
Page range: 34 - 45
Published on: Sep 21, 2026
Published by: International Network for Social Network Analysis (INSNA)
In partnership with: Paradigm Publishing Services
Publication frequency: 1 issue per year
Related subjects:
© 2026 Jean Guillaume, Tyriana Williams, published by International Network for Social Network Analysis (INSNA)
This work is licensed under the Creative Commons Attribution-NonCommercial 4.0 License.