论文部分内容阅读
The asymptotic properties of the numbers of spanning trees and Eulerian trails in circulant digraphs and graphs are studied. Let C(p, s1<sub>,</sub> s<sub>2</sub>,…, s<sub>k</sub>) be a directed cireulant graph. Let T(C