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 条
  • [31] Strong arc decompositions of split digraphs
    Bang-Jensen, Jorgen
    Wang, Yun
    JOURNAL OF GRAPH THEORY, 2025, 108 (01) : 5 - 26
  • [32] Center of Cartesian and strong product of digraphs
    Narasimha-Shenoi, Prasanth G.
    Joseph, Mary Shalet Thottungal
    JOURNAL OF THE RAMANUJAN MATHEMATICAL SOCIETY, 2021, 36 (04) : 267 - 273
  • [33] Strong Connectedness of Generalized Circulant Digraphs
    Li Xueliang (1) \ \ Elkin Vumar (2) (1)(Department of Applied Mathematics Northwestern Polytechnical University Xi’an
    新疆大学学报(自然科学版), 1998, (02) : 2 - 9
  • [34] Packing and counting arbitrary Hamilton cycles in random digraphs
    Ferber, Asaf
    Long, Eoin
    RANDOM STRUCTURES & ALGORITHMS, 2019, 54 (03) : 499 - 514
  • [35] Counting small cycles in generalized de Bruijn digraphs
    Hasunuma, T
    Shibata, Y
    NETWORKS, 1997, 29 (01) : 39 - 47
  • [36] Counting oriented trees in digraphs with large minimum semidegree
    Joos, Felix
    Schrodt, Jonathan
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2024, 168 : 236 - 270
  • [37] (Strong) Total proper connection of some digraphs
    Yingbin Ma
    Kairui Nie
    Journal of Combinatorial Optimization, 2021, 42 : 24 - 39
  • [38] (Strong) Proper vertex connection of some digraphs
    Nie, Kairui
    Ma, Yingbin
    Sidorowicz, Ezbieta
    APPLIED MATHEMATICS AND COMPUTATION, 2023, 458
  • [39] The Twin Domination Number of Strong Product of Digraphs
    MA HONG-XIA
    LIU JUAN
    Du Xian-kun
    CommunicationsinMathematicalResearch, 2016, 32 (04) : 332 - 338
  • [40] Finding coherent cyclic orders in strong digraphs
    Satoru Iwata
    Takuro Matsuda
    Combinatorica, 2008, 28
12345