On Gorenstein circulant graphs

被引:1
|
作者
Nikseresht, Ashkan [1 ]
Oboudi, Mohammad Reza [1 ]
机构
[1] Shiraz Univ, Coll Sci, Dept Math, Shiraz 7145744776, Iran
关键词
Gorenstein simplicial complex; Edge ideal; Circulant graph; CHORDALITY; CLUTTERS;
D O I
10.1016/j.disc.2023.113472
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
We characterize some graphs with a Gorenstein edge ideal. In particular, we show that if G is a circulant graph with vertex degree at most four or a circulant graph of the form Cn(1, ... , d) for some d <= n/2, then G is Gorenstein if and only if G similar to= tK2 or G similar to= tCn or G similar to= tC13(1, 5) for some integers t and n >= 4.(c) 2023 Elsevier B.V. All rights reserved.
引用
收藏
页数:6
相关论文
共 50 条
  • [41] STRONG REGULARITY AND CIRCULANT GRAPHS
    MARUSIC, D
    DISCRETE MATHEMATICS, 1989, 78 (1-2) : 119 - 125
  • [42] Pancyclicity of connected circulant graphs
    Bogdanowicz, ZR
    JOURNAL OF GRAPH THEORY, 1996, 22 (02) : 167 - 174
  • [43] On isomorphic factorizations of circulant graphs
    Alspach, Brian
    Dyer, Danny
    Kreher, Donald L.
    JOURNAL OF COMBINATORIAL DESIGNS, 2006, 14 (05) : 406 - 414
  • [44] Perfect codes in circulant graphs
    Feng, Rongquan
    Huang, He
    Zhou, Sanming
    DISCRETE MATHEMATICS, 2017, 340 (07) : 1522 - 1527
  • [45] Diameters of random circulant graphs
    Jens Marklof
    Andreas Strömbergsson
    Combinatorica, 2013, 33 : 429 - 466
  • [46] On planarity and colorability of circulant graphs
    Heuberger, C
    DISCRETE MATHEMATICS, 2003, 268 (1-3) : 153 - 169
  • [47] Some Invariants of Circulant Graphs
    Munir, Mobeen
    Nazeer, Waqas
    Shahzadi, Zakia
    Kang, Shin Min
    SYMMETRY-BASEL, 2016, 8 (11):
  • [48] Defensive alliances in circulant graphs
    Araujo-Pardo, G.
    Barriere, L.
    ARS COMBINATORIA, 2014, 115 : 115 - 138
  • [49] The Kirchhoff Indices for Circulant Graphs
    Mednykh, A. D.
    Mednykh, I. A.
    SIBERIAN MATHEMATICAL JOURNAL, 2024, 65 (06) : 1359 - 1372
  • [50] On Dispersability of Some Circulant Graphs
    Kainen P.C.
    Joslin S.
    Overbay S.
    Journal of Graph Algorithms and Applications, 2024, 28 (01) : 225 - 241