Counting strong digraphs

被引：0

|

作者：

Robinson, Robert W. ^{[1
]}

机构：

[1] University of Newcastle, United Kingdom

来源：

Journal of Graph Theory | 1977年 / 1卷 / 02期

关键词：

D O I：

10.1002/jgt.3190010215

中图分类号：

学科分类号：

摘要：

引用

收藏

页码：189 / 190

相关论文

共 50 条

[1] Counting acyclic and strong digraphs by descents
Archer, Kassie
Gessel, Ira M.
Graves, Christina
Liang, Xuming
DISCRETE MATHEMATICS, 2020, 343 (11)
[2] Counting paths in digraphs
Seymour, Paul
Sullivan, Blair D.
EUROPEAN JOURNAL OF COMBINATORICS, 2010, 31 (03) : 961 - 975
[3] A PATH COUNTING PROBLEM IN DIGRAPHS
ZIKAN, K
SCHMEICHEL, E
FIBONACCI QUARTERLY, 1985, 23 (01): : 3 - 6
[4] Counting extensional acyclic digraphs
Policriti, Alberto
Tomescu, Alexandru I.
INFORMATION PROCESSING LETTERS, 2011, 111 (16) : 787 - 791
[5] NUMBER OF STRONG DIGRAPHS
WRIGHT, EM
NOTICES OF THE AMERICAN MATHEMATICAL SOCIETY, 1970, 17 (06): : 948 - &
[6] MINIMALLY STRONG DIGRAPHS
GELLER, DP
PROCEEDINGS OF THE EDINBURGH MATHEMATICAL SOCIETY, 1970, 17 : 15 - &
[7] Minimal strong digraphs
Garcia-Lopez, J.
Marijuan, C.
DISCRETE MATHEMATICS, 2012, 312 (04) : 737 - 744
[8] A matrix for counting paths in acyclic digraphs
Stanley, RP
JOURNAL OF COMBINATORIAL THEORY SERIES A, 1996, 74 (01) : 169 - 172
[9] Counting acyclic digraphs by sources and sinks
Gessel, IM
DISCRETE MATHEMATICS, 1996, 160 (1-3) : 253 - 258
[10] ON STRONG DIGRAPHS WITH A UNIQUE MINIMALLY STRONG SUBDIGRAPH
BRUALDI, RA
MANBER, R
DISCRETE MATHEMATICS, 1988, 71 (01) : 1 - 7

← 1 2 3 4 5 →