A Combinatorial Proof of a Formula of Biane and Chapuy

Electronic Journal Of Combinatorics

Sinho Chewi¹ 

关键词: Directed graph;    Markov chain tree theorem;    Spanning trees;    Zeta function;   

DOI  :  

学科分类：离散数学和组合数学

来源: Electronic Journal Of Combinatorics

【 摘 要 】

Let $G$ be a simple strongly connected weighted directed graph. Let $\mathcal{G}$ denote the spanning tree graph of $G$. That is, the vertices of $\mathcal{G}$ consist of the directed rooted spanning trees on $G$, and the edges of $\mathcal{G}$ consist of

【 授权许可】

Others