On the number of spanning trees in directed circulant graphs

Networks ◽  
10.1002/net.2 ◽  
2001 ◽  
Vol 37 (3) ◽  
pp. 129-133 ◽  
Author(s):  
Zbigniew Lonc ◽  
Krzysztof Parol ◽  
Jacek M. Wojciechowski
2020 ◽  
Vol 27 (01) ◽  
pp. 87-94
Author(s):  
A.D. Mednykh ◽  
I.A. Mednykh

Let [Formula: see text] be the generating function for the number [Formula: see text] of spanning trees in the circulant graph Cn(s1, s2, …, sk). We show that F(x) is a rational function with integer coefficients satisfying the property F(x) = F(1/x). A similar result is also true for the circulant graphs C2n(s1, s2, …, sk, n) of odd valency. We illustrate the obtained results by a series of examples.


2006 ◽  
Vol 306 (22) ◽  
pp. 2817-2827 ◽  
Author(s):  
Talip Atajan ◽  
Xuerong Yong ◽  
Hiroshi Inaba

2015 ◽  
Vol 92 (3) ◽  
pp. 365-373 ◽  
Author(s):  
JUSTINE LOUIS

We consider the number of spanning trees in circulant graphs of ${\it\beta}n$ vertices with generators depending linearly on $n$. The matrix tree theorem gives a closed formula of ${\it\beta}n$ factors, while we derive a formula of ${\it\beta}-1$ factors. We also derive a formula for the number of spanning trees in discrete tori. Finally, we compare the spanning tree entropy of circulant graphs with fixed and nonfixed generators.


2000 ◽  
Vol 223 (1-3) ◽  
pp. 337-350 ◽  
Author(s):  
Yuanping Zhang ◽  
Xuerong Yong ◽  
Mordecai J. Golin

2004 ◽  
Vol 282 (1-3) ◽  
pp. 69-79 ◽  
Author(s):  
Xiebin Chen ◽  
Qiuying Lin ◽  
Fuji Zhang

Sign in / Sign up

Export Citation Format

Share Document