Directed burning number

Let \(G\) be an undirected graph. An orientation \(\vec G\) of \(G\) is a directed graph in which every edge of \(G\) is assigned a direction. Directed graph burning is an iterative graph exploration process in which each round consists of two phases: spreading, then vertex selection. Each vertex is initially considered unburned. In the spreading phase, each burned vertex burns all of its out-neighbors. In the vertex selection phase, a vertex is chosen and burned. The burning number of a directed graph \(b(\vec G)\) is the minimum number of rounds necessary to burn all vertices of \(G\). The orientable burning number of an undirected graph \(G\), denoted \(B(G)\), is the maximum burning number across all orientations of \(G\). In this paper, we prove two main results. First, for any integer \(k\) between the minimum and maximum burning numbers of orientations of \(G\), there exists an orientation \(\vec G\) such that \(b(\vec G) = k\). We also determine the orientable burning number of wheels using a bound on the join of directed graphs.

Authors

Institutions

Publication Details

Journal
Ars Combinatoria
Published
2026-11-15
DOI
https://doi.org/10.61091/ars168-09
Primary Topic
Advanced Graph Theory Research
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Directed burning number

Adam Blumenthal, Michael Tripp, Zachary LaFrankie
Ars Combinatoria
Advanced Graph Theory Research
article

Directed burning number

Adam Blumenthal, Michael Tripp, Zachary LaFrankie
article en

Abstract

Let \(G\) be an undirected graph. An orientation \(\vec G\) of \(G\) is a directed graph in which every edge of \(G\) is assigned a direction. Directed graph burning is an iterative graph exploration process in which each round consists of two phases: spreading, then vertex selection. Each vertex is initially considered unburned. In the spreading phase, each burned vertex burns all of its out-neighbors. In the vertex selection phase, a vertex is chosen and burned. The burning number of a directed graph \(b(\vec G)\) is the minimum number of rounds necessary to burn all vertices of \(G\). The orientable burning number of an undirected graph \(G\), denoted \(B(G)\), is the maximum burning number across all orientations of \(G\). In this paper, we prove two main results. First, for any integer \(k\) between the minimum and maximum burning numbers of orientations of \(G\), there exists an orientation \(\vec G\) such that \(b(\vec G) = k\). We also determine the orientable burning number of wheels using a bound on the join of directed graphs.

Ars CombinatoriaVol. 168
Westminster College - Pennsylvania (US)
Advanced Graph Theory Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon
Directed burning number — Adam Blumenthal, Michael Tripp, et al. · Ars Combinatoria (2026) | TGRS Research Map | TGRS