A study on co-intersection graphs of rings

被引：0
|
作者：
Department of Mathematics Faculty of Mathematical Sciences University of Mazandaran, Babolsar, Iran [1 ]
机构：
来源：
Ital. J. Pure Appl. Math. | / 51卷 / 232-242期
关键词：
Compilation and indexing terms; Copyright 2025 Elsevier Inc;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [21] CO-MAXIMAL IDEAL GRAPHS OF COMMUTATIVE RINGS
    Ye, Meng
    Wu, Tongsuo
    JOURNAL OF ALGEBRA AND ITS APPLICATIONS, 2012, 11 (06)
  • [22] The Co-annihilating-ideal Graphs of Commutative Rings
    Akbari, Saeeid
    Alilou, Abbas
    Amjadi, Jafar
    Sheikholeslami, Eyed Mahmoud
    CANADIAN MATHEMATICAL BULLETIN-BULLETIN CANADIEN DE MATHEMATIQUES, 2017, 60 (01): : 3 - 11
  • [23] INTERSECTION GROUPS AND RINGS
    SCOTT, DB
    PROCEEDINGS OF THE CAMBRIDGE PHILOSOPHICAL SOCIETY, 1946, 42 (02): : 183 - 184
  • [24] Maximum Cliques in Graphs with Small Intersection Number and Random Intersection Graphs
    Nikoletseas, Sotiris
    Raptopoulos, Christoforos
    Spirakis, Paul G.
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2012, 2012, 7464 : 728 - 739
  • [25] Maximum cliques in graphs with small intersection number and random intersection graphs
    Nikoletseas, Sotiris E.
    Raptopoulos, Christoforos L.
    Spirakis, Paul G.
    COMPUTER SCIENCE REVIEW, 2021, 39
  • [26] Chordal graphs as intersection graphs of pseudosegments
    Dangelmayr, Cornelia
    Felsner, Stefan
    GRAPH DRAWING, 2007, 4372 : 208 - +
  • [27] On the hyperbolicity of bipartite graphs and intersection graphs
    Coudert, David
    Ducoffe, Guillaume
    DISCRETE APPLIED MATHEMATICS, 2016, 214 : 187 - 195
  • [28] INTERSECTION GRAPHS OF CONCATENABLE SUBTREES OF GRAPHS
    GAVRIL, F
    URRUTIA, J
    DISCRETE APPLIED MATHEMATICS, 1994, 52 (02) : 195 - 209
  • [29] COMPARABILITY-GRAPHS AND INTERSECTION GRAPHS
    GOLUMBIC, MC
    ROTEM, D
    URRUTIA, J
    DISCRETE MATHEMATICS, 1983, 43 (01) : 37 - 46
  • [30] Intersection graphs of pseudosegments: Chordal graphs
    Dangelmayr C.
    Felsner S.
    Trotter W.T.
    Journal of Graph Algorithms and Applications, 2010, 14 (02) : 199 - 220
12345