Name
Abstract | ||
|---|---|---|
Motivated by a graph theoretic process intended to measure the speed of the spread of contagion in a graph, Bonato et al. (Burning a Graph as a Model of Social Contagion, Lecture Notes in Computer Science 8882 (2014) 13-22) define the burning number b(G) of a graph G as the smallest integer k for which there are vertices x1,…,xk such that for every vertex u of G, there is some i∈{1,…,k} with distG(u,xi)≤k−i, and distG(xi,xj)≥j−i for every i,j∈{1,…,k}. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1016/j.dam.2017.09.012 | Discrete Applied Mathematics |
Keywords | Field | DocType |
Graphs,Burning,Distance domination | Integer,Discrete mathematics,Graph,Combinatorics,Bound graph,Vertex (geometry),Connectivity,Conjecture,Mathematics | Journal |
Volume | ISSN | Citations |
235 | 0166-218X | 5 |
PageRank | References | Authors |
0.64 | 2 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Stéphane Bessy | 1 | 117 | 19.68 |
| anthony bonato | 2 | 94 | 19.61 |
| Jeannette C. M. Janssen | 3 | 73 | 10.23 |
| Dieter Rautenbach | 4 | 946 | 138.87 |
| elham roshanbin | 5 | 26 | 4.31 |