

























By using biclique partitions of digraphs, this paper gives reduction formulas for the number of oriented spanning trees, stationary distribution vector and Kemeny's constant of digraphs. As applications, we give a method for enumerating spanning trees of undirected graphs by vertex degrees and biclique partitions. The biclique partition formula also extends the results of Knuth and Levine from line digraphs to general digraphs.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。