ENUMERATION OF PATHS IN DIGRAPHS

被引：6
|
作者：
PARTHASARATHY, KR
机构：
来源：
PSYCHOMETRIKA | 1964年 / 29卷 / 02期
关键词：
D O I：
10.1007/BF02289697
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
引用
收藏
页码：153 / 165
页数：13
相关论文
共 50 条
  • [41] A matrix for counting paths in acyclic digraphs
    Stanley, RP
    JOURNAL OF COMBINATORIAL THEORY SERIES A, 1996, 74 (01) : 169 - 172
  • [42] On kernels by monochromatic paths in the corona of digraphs
    Wloch, Iwona
    CENTRAL EUROPEAN JOURNAL OF MATHEMATICS, 2008, 6 (04): : 537 - 542
  • [43] Paths and cycles in extended and decomposable digraphs
    BangJensen, J
    Gutin, G
    DISCRETE MATHEMATICS, 1997, 164 (1-3) : 5 - 19
  • [44] Diameter, short paths and superconnectivity in digraphs
    Marcote, X
    Balbuena, C
    Pelayo, I
    DISCRETE MATHEMATICS, 2004, 288 (1-3) : 113 - 123
  • [45] On extremal weighted digraphs with no heavy paths
    Li, Binlong
    Zhang, Shenggui
    DISCRETE MATHEMATICS, 2010, 310 (10-11) : 1640 - 1644
  • [46] ENUMERATION OF SUCCESS PATHS IN A GRAPH
    HURA, GS
    MICROELECTRONICS AND RELIABILITY, 1982, 22 (05): : 1033 - 1034
  • [47] Enumeration of Glued Grephs of Paths
    Ruangnai, Monthiya
    Panma, Sayan
    COMMUNICATIONS IN MATHEMATICS AND APPLICATIONS, 2019, 10 (04): : 783 - 796
  • [48] On the Enumeration of Bicriteria Temporal Paths
    Mutzel, Petra
    Oettershagen, Lutz
    THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, TAMC 2019, 2019, 11436 : 518 - 535
  • [49] Asymptotic enumeration of digraphs and bipartite graphs by degree sequence
    Liebenau, Anita
    Wormald, Nick
    RANDOM STRUCTURES & ALGORITHMS, 2023, 62 (02) : 259 - 286
  • [50] Asymptotic enumeration of strongly connected digraphs by vertices and edges
    Perez-Gimenez, Xavier
    Wormald, Nicholas
    RANDOM STRUCTURES & ALGORITHMS, 2013, 43 (01) : 80 - 114
12345