Strong Connectedness of Generalized Circulant Digraphs

被引：0
|
作者：
Li Xueliang (1) \ \ Elkin Vumar (2) (1)(Department of Applied Mathematics Northwestern Polytechnical University Xi’an
机构：
来源：
新疆大学学报(自然科学版)(中英文) | 1998年 / 02期
关键词：
Generalized; Strong; Digraphs; Circulant; Connectedness;
D O I：
暂无
中图分类号：
O157.5 [图论];
学科分类号：
070104 ;
摘要：
１ＴｅｒｍｉｎｏｌｏｇｙａｎｄＮｏｔａｔｉｏｎＴｈｒｏｕｇｈｏｕｔｔｈｉｓｐａｐｅｒ，ｎｄｅｎｏｔｅｓａｐｏｓｉｔｉｖｅｉｎｔｅｇｅｒ，ｋｉｓａｐｏｓｉｔｉｖｅｉｎｔｅｇｅｒｎｏｔｇｒｅａｔｅｒｔｈａｎｎ．Ｎｄｅｎｏｔｅｓｔｈｅｓｅｔ｛１，２，…，ｎ...
引用
收藏
页码：2 / 9
页数：8
相关论文
共 50 条
  • [31] A Classification of Spectrum-determined Circulant Digraphs
    Zheng-xin Qin
    Ji-xiang Meng
    Qiong-xiang Huang
    Acta Mathematicae Applicatae Sinica, English Series, 2018, 34 : 703 - 709
  • [32] Cycles in 3-anti-circulant digraphs
    Wang, Ruixia
    AUSTRALASIAN JOURNAL OF COMBINATORICS, 2014, 60 : 158 - 168
  • [33] The automorphism groups of circulant digraphs of degree 3
    Huang, QX
    Yuan, JJ
    ARS COMBINATORIA, 1996, 44 : 263 - 271
  • [34] On M-self-complement circulant digraphs
    Zhou, YS
    PROCEEDINGS OF THE SECOND ASIAN MATHEMATICAL CONFERENCE 1995, 1998, : 292 - 296
  • [35] A Classification of Spectrum-determined Circulant Digraphs
    Qin, Zheng-xin
    Meng, Ji-xiang
    Huang, Qiong-xiang
    ACTA MATHEMATICAE APPLICATAE SINICA-ENGLISH SERIES, 2018, 34 (04): : 703 - 709
  • [36] The automorphism groups of minimal infinite circulant digraphs
    Meng, JX
    Huang, QX
    EUROPEAN JOURNAL OF COMBINATORICS, 1997, 18 (04) : 425 - 429
  • [37] Hamiltonian cycles in circulant digraphs with two stripes
    Yang, QF
    Burkard, RE
    Cela, E
    Woeginger, GJ
    DISCRETE MATHEMATICS, 1997, 176 (1-3) : 233 - 254
  • [38] Connectedness of digraphs from quadratic polynomials
    Chen, Siji
    Chen, Sheng
    INVOLVE, A JOURNAL OF MATHEMATICS, 2020, 13 (02): : 357 - 360
  • [39] Weak connectedness of tensor product of digraphs
    Chen, Sheng
    Chen, Xiaomei
    DISCRETE APPLIED MATHEMATICS, 2015, 185 : 52 - 58
  • [40] Circulant digraphs integral over number fields
    Li, Fei
    DISCRETE MATHEMATICS, 2013, 313 (06) : 821 - 823
12345