Counting strong digraphs

被引:0
|
作者
Robinson, Robert W. [1 ]
机构
[1] University of Newcastle, United Kingdom
关键词
D O I
10.1002/jgt.3190010215
中图分类号
学科分类号
摘要
引用
收藏
页码:189 / 190
相关论文
共 50 条
  • [21] COUNTING THE NUMBER OF HAMILTON CYCLES IN RANDOM DIGRAPHS
    FRIEZE, A
    SUEN, S
    RANDOM STRUCTURES & ALGORITHMS, 1992, 3 (03) : 235 - 241
  • [22] COUNTING FLAGS IN TRIANGLE-FREE DIGRAPHS
    Hladky, Jan
    Kral', Daniel
    Norin, Sergey
    COMBINATORICA, 2017, 37 (01) : 49 - 76
  • [23] A Matrix for Counting Paths in Acyclic Colored Digraphs
    Bera, Sudip
    GRAPHS AND COMBINATORICS, 2024, 40 (03)
  • [24] Counting flags in triangle-free digraphs
    Jan Hladký
    Daniel Král’
    Sergey Norin
    Combinatorica, 2017, 37 : 49 - 76
  • [25] Counting lines in semi-complete digraphs
    Araujo-Pardo, Gabriela
    Matamala, Martin
    Zamora, Jose
    XII LATIN-AMERICAN ALGORITHMS, GRAPHS AND OPTIMIZATION SYMPOSIUM, LAGOS 2023, 2023, 224 : 352 - 359
  • [26] The strong metric dimension of graphs and digraphs
    Oellermann, Ortrud R.
    Peters-Fransen, Joel
    DISCRETE APPLIED MATHEMATICS, 2007, 155 (03) : 356 - 364
  • [27] (Strong) Proper Connection in Some Digraphs
    Ma, Yingbin
    Nie, Kairui
    IEEE ACCESS, 2019, 7 : 69692 - 69697
  • [28] Strong Subgraph Connectivity of Digraphs: A Survey
    Sun, Yuefang
    Gutin, Gregory
    JOURNAL OF INTERCONNECTION NETWORKS, 2021, 21 (04)
  • [29] EXPONENTS AND DIAMETERS OF STRONG PRODUCTS OF DIGRAPHS
    Kim, Byeong Moon
    Song, Byung Chul
    Hwang, Woonjae
    ELECTRONIC JOURNAL OF LINEAR ALGEBRA, 2011, 22 : 1106 - 1111
  • [30] Structure of cycles in minimal strong digraphs
    Arcos-Argudo, Miguel
    Garcia-Lopez, Jesus
    Pozo-Coronado, Luis M.
    DISCRETE APPLIED MATHEMATICS, 2019, 263 : 35 - 41