Abstract
Graph burning runs on discrete time-steps. The aim is to burn all the vertices in a given graph using a minimum number of time-steps. This number is k......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
