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 条
  • [31] Two families of circulant nut graphs
    Damnjanovic, Ivan
    FILOMAT, 2023, 37 (24) : 8331 - 8360
  • [32] Achromatic and Harmonious Colorings of Circulant Graphs
    Debski, Michal
    Lonc, Zbigniew
    Rzazewski, Pawel
    JOURNAL OF GRAPH THEORY, 2018, 87 (01) : 18 - 34
  • [33] Betti Numbers of Some Circulant Graphs
    Makvand, Mohsen Abdi
    Mousivand, Amir
    CZECHOSLOVAK MATHEMATICAL JOURNAL, 2019, 69 (03) : 593 - 607
  • [34] Betti Numbers of Some Circulant Graphs
    Mohsen Abdi Makvand
    Amir Mousivand
    Czechoslovak Mathematical Journal, 2019, 69 : 593 - 607
  • [35] COHEN-MACAULAY CIRCULANT GRAPHS
    Vander Meulen, Kevin N.
    Van Tuyl, Adam
    Watt, Catriona
    COMMUNICATIONS IN ALGEBRA, 2014, 42 (05) : 1896 - 1910
  • [36] On the broadcast independence number of circulant graphs
    Laouar, Abdelamin
    Bouchemakh, Isma
    Sopena, Eric
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2024, 16 (05)
  • [37] The game of Cops and Robber on circulant graphs
    Fitzpatrick, Shannon L.
    Larkin, John Paul
    DISCRETE APPLIED MATHEMATICS, 2017, 225 : 64 - 73
  • [38] Well-covered circulant graphs
    Brown, Jason
    Hoshino, Richard
    DISCRETE MATHEMATICS, 2011, 311 (04) : 244 - 251
  • [39] Some star extremal circulant graphs
    Lin, WS
    DISCRETE MATHEMATICS, 2003, 271 (1-3) : 169 - 177
  • [40] The number of rooted forests in circulant graphs
    Grunwald, Lilya A.
    Mednykh, Ilya
    ARS MATHEMATICA CONTEMPORANEA, 2022, 22 (04)