Advanced search
Publication Cover
AKCE International Journal of Graphs and Combinatorics Volume 20, 2023 - Issue 2: International Conference on Linear Algebra and its Applications; Guest editors: Ravindra B Bapat, Manjunatha Prasad Karantha,Stephen J Kirkland, Simo Puntanen, S Arumugam
Submit an article Journal homepage
451
Views
0
CrossRef citations to date
0
Altmetric
Research Articles

Selection of activators in finding the burning number

Sumathi S.Vellore Institute of Technology, Chennai, Tamil Nadu, India
&
G. Hannah GraceVellore Institute of Technology, Chennai, Tamil Nadu, IndiaCorrespondence[email protected]
Pages 115-119 | Received 02 Jun 2023, Accepted 02 Jul 2023, Published online: 19 Jul 2023

References

  • Baron, S., Fons, M., Albrecht, T. (1996). Viral Pathogenesis Medical Microbiology. Galveston, TX: University of Texas. https://www.ncbi.nlm.nih.gov/books/NBK8149/
  • Bessy, S., Bonato, A., Janssen, J., Rautenbach, D., Roshanbin, E. (2017). Burning a graph is hard. Discrete Appl. Math. 232: 73–87.
  • Bessy, S., Bonato, A., Janssen, J., Rautenbach, D., Roshanbin, E. (2018). Bounds on the burning number. Discrete Appl. Math. 235: 16–22.
  • Bloch, F., Jackson, M. O., Tebaldi, P. (2023). Centrality measures in networks. Soc. Choice Welf.
  • Bonato, A., Janssen, J., Roshanbin, E. (2016). How to burn a graph. Int. Math. 12(1–2): 85–100.
  • Bonato, A., Kamali, S. (2019). Approximation algorithms for graph burning. In: Gopal, T., Watada, J., eds. Theory and Applications of Models of Computation. TAMC 2019. Lecture Notes in Computer Science, 11436. Cham: Springer.
  • Bonato, A. (2020). A survey of graph burning. arXiv preprint arXiv:2009.10642.
  • Borgatti, S. P. (2005). Centrality and network flow. Soc. Netw. 27(1): 55–71.
  • Csardi, G., Nepusz, T. (2006). The igraph software package for complex network research. Int. Complex Syst. 1695(5): 1–9. https://www.researchgate.net/publication/221995787_The_Igraph_Software_Package_for_Complex_Network_Research
  • Farokh, Z. R., Tahmasbi, M., Tehrani, Z. H. R. A., Buali, Y. (2020). New heuristics for burning graphs. arXiv preprint arXiv:2003.09314.
  • Gautam, R. K., Kare, A. S., Durga Bhavani, S. (2022). Faster heuristics for graph burning. Appl. Intell. 52: 1351–1361.
  • Gross, D. J., Saccoman, J. T., Suffel, C. L. (2015). Spanning tree results for graphs and multigraphs: A Matrix-theoretic approach. 10.1142/9789814566049_0002
  • Kempe, D., Kleinberg, J., Tardos, É. (2003). Maximizing the spread of influence through a social network. In: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 137–146.
  • Lusseau, D., Schneider, K., Boisseau, O. J., Haase, P., Slooten, E., Dawson, S. M. 2003. The bottlenose dolphin community of Doubtful Sound features a large proportion of long-lasting associations. Behav. Ecol. Sociobiol. 54(4): 396–405.
  • Meghanathan, N. (2017). Randomness index for complex network analysis. Soc. Netw. Anal. Min. 7(1): 1–15.
  • Rossi, R., Ahmed, N. (2015). The network data repository with interactive graph analytics and visualization. In: Twenty-ninth AAAI Conference on Artificial Intelligence.
  • Šimon, M., Huraj, L., Luptáková, I. D., Pospíchal, J. (2019). Heuristics for spreading alarm throughout a network. Appl. Sci. 9(16): 3269.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.