On constructing rational spanning tree edge densities.

Discrete Applied Mathematics（2016）

引用 2|浏览7

暂无评分

摘要

Let ź ( G ) and ź G ( e ) denote the number of spanning trees of a graph G and the number of spanning trees of G containing edge e of G , respectively. Ferrara, Gould, and Suffel asked if, for every rational 0

查看译文

关键词

Spanning trees,Resistance distance,Random walks on graphs

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要