Year: 2024
Type: preprint
Abstract: A rooted arborescence of a directed graph is a spanning tree directed towards a particular vertex. A recent work of Chepuri et al. showed that the arborescences of a covering graph of a directed graph G are closely related to the arborescences of G. In this paper, we study the weighted sum of arborescences of a random covering graph and give a formula for the expected value, resolving a conjecture of Chepuri et al.
Source: arXiv (Cornell University)
Authors: Ju, Muchen, Ni, Junjie, Wang, Kaixin, Xiao, Yihan
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W4405562111