Asymptotic enumeration theorems for the numbers of spanning trees and Eulerian trails in circulant digraphs and graphs

被引：0

作者：

Zhang, FJ ^{[1
]}

Yong, XR

机构：

[1] Xiamen Univ, Dept Math, Xiamen 361005, Peoples R China

[2] Hong Kong Univ Sci & Technol, Dept Comp Sci, Hong Kong, Peoples R China

[3] Xinjiang Univ, Dept Math, Urumqi 361005, Peoples R China

来源：

SCIENCE IN CHINA SERIES A-MATHEMATICS PHYSICS ASTRONOMY | 1999年 / 42卷 / 03期

关键词：

asymptotic enumeration; Eulerian trails; graph; circulant;

D O I：

暂无

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

The asymptotic properties of the numbers of spanning trees and Eulerian trails in circulant digraphs and graphs are studied. Let C(p, s(1), s(2),...,s(k)) be a directed circulant graph. Let T(C(p, s(1), s(2),...,s(k))) and E(C(p, s(1), s(2),...,s(k))) be the numbers of spanning trees and of Eulerian trails, respectively. Then [GRAPHICS] Furthermore, their line digraph and iterations are dealt with and similar results are obtained for undirected circulant graphs.

引用

页码：264 / 271

页数：8

共 50 条

[1] Asymptotic enumeration theorems for the numbers of spanning trees and Eulerian trails in circulant digraphs and graphs
张福基
永学荣
[J]. Science in China,Ser.A., 1999, Ser.A.1999 (03) - 271
[2] Asymptotic enumeration theorems for the numbers of spanning trees and Eulerian trails in circulant digraphs and graphs
Zhang Fuji
Yong Xuerong
[J]. Science in China Series A: Mathematics, 1999, 42 (3): : 264 - 271
[3] Asymptotic enumeration theorems for the numbers of spanning trees and Eulerian trails in circulant digraphs and graphs
张福基
永学荣
[J]. Science China Mathematics, 1999, (03) : 264 - 271
[4] The asymptotic number of spanning trees in circulant graphs
Golin, Mordecai J.
Yong, Xuerong
Zhang, Yuanping
[J]. DISCRETE MATHEMATICS, 2010, 310 (04) : 792 - 803
[5] THE ASYMPTOTIC NUMBERS OF REGULAR TOURNAMENTS, EULERIAN DIGRAPHS AND EULERIAN ORIENTED GRAPHS
MCKAY, BD
[J]. COMBINATORICA, 1990, 10 (04) : 367 - 377
[6] The Asymptotic Number of Spanning Trees in Circulant Graphs (Extended Abstract)
Golin, Mordecai J.
Yong, Xuerong
Zhang, Yuanping
[J]. PROCEEDINGS OF THE NINTH WORKSHOP ON ALGORITHM ENGINEERING AND EXPERIMENTS AND THE FOURTH WORKSHOP ON ANALYTIC ALGORITHMICS AND COMBINATORICS, 2007, : 242 - +
[7] Number of Spanning Trees of Some Circulant Graphs and Their Asymptotic Behavior
Elsonbaty, A.
Daoud, S. N.
Al-Ahmady, H.
[J]. INTERNATIONAL JOURNAL OF APPLIED MATHEMATICS & STATISTICS, 2012, 30 (06): : 93 - 102
[8] On the asymptotic behavior of the maximum number of spanning trees in circulant graphs
Lonc, Z
Parol, K
Wojciechowski, JM
[J]. NETWORKS, 1997, 30 (01) : 47 - 56
[9] Enumeration of spanning trees of middle digraphs
Chen, Xuemei
Jin, Xian'an
Yan, Weigen
[J]. LINEAR & MULTILINEAR ALGEBRA, 2022, 70 (22): : 7484 - 7492
[10] ACHROMATIC NUMBERS FOR CIRCULANT GRAPHS AND DIGRAPHS
Araujo-Pardo, Gabriela
Jose Montellano-Ballesteros, Juan
Olsen, Mika
Rubio-Montiel, Christian
[J]. DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2021, 41 (03) : 713 - 724

← 1 2 3 4 5 →