ORBIT EQUIVALENCE OF GRAPHS AND ISOMORPHISM OF GRAPH GROUPOIDS

被引:8
|
作者
Carlsen, Toke Meier [1 ]
Winger, Marius Lie [2 ]
机构
[1] Univ Faroe Isl, Dept Sci & Technol, Noatun 3, FO-100 Torshavn, Denmark
[2] Norwegian Univ Sci & Technol, Fac Teacher & Interpreter Educ, Dept Teacher Educ & BA Arch & Collect Managem 1 7, Postboks 8900, N-7491 Trondheim, Norway
关键词
ALGEBRAS;
D O I
10.7146/math.scand.a-105087
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
We show that the groupoids of two directed graphs are isomorphic if and only if the two graphs are orbit equivalent by an orbit equivalence that preserves isolated eventually periodic points. We also give a complete description of the (topological) isolated points of the boundary path space of a graph. As a result, we are able to show that the groupoids of two directed graphs with finitely many vertices and no sinks are isomorphic if and only if the two graphs are orbit equivalent, and that the groupoids of the stabilisations of two such graphs are isomorphic if and only if the stabilisations of the graphs are orbit equivalent.
引用
收藏
页码:239 / 248
页数:10
相关论文
共 50 条
  • [21] EQUIVALENCE AND EXACT GROUPOIDS
    Lalonde, Scott M.
    HOUSTON JOURNAL OF MATHEMATICS, 2016, 42 (04): : 1267 - 1290
  • [22] Accelarating graph isomorphism algorithm by finer classification of layered graphs
    Fukuda, K
    Nakamori, M
    PDPTA'2001: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, 2001, : 1271 - 1276
  • [23] Natural Isomorphism Classes of Cycle Permutation Graphs Over a Graph
    Hye Kyung Kim
    Jin Hwan Kim
    Daekeun Lim
    Graphs and Combinatorics, 1999, 15 : 327 - 336
  • [24] Natural isomorphism classes of cycle permutation graphs over a graph
    Kim, HK
    Kim, JH
    Lim, D
    GRAPHS AND COMBINATORICS, 1999, 15 (03) : 327 - 336
  • [25] Compatible topologies on graphs:: An application to graph isomorphism problem complexity
    Bretto, Alain
    Faisant, Alain
    Vallee, Thierry
    THEORETICAL COMPUTER SCIENCE, 2006, 362 (1-3) : 255 - 272
  • [26] Isomorphism Theorems for Groupoids and Some Applications
    Avila, Jesus
    Marin, Victor
    Pinedo, Hector
    INTERNATIONAL JOURNAL OF MATHEMATICS AND MATHEMATICAL SCIENCES, 2020, 2020
  • [27] Permutation Code Equivalence is Not Harder Than Graph Isomorphism When Hulls Are Trivial
    Bardet, Magali
    Otmani, Ayoub
    Saeed-Taha, Mohamed
    2019 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2019, : 2464 - 2468
  • [28] DECIDABILITY OF FLOW EQUIVALENCE AND ISOMORPHISM PROBLEMS FOR GRAPH C*-ALGEBRAS AND QUIVER REPRESENTATIONS
    Boyle, Mike
    Steinberg, Benjamin
    PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY, 2023, 151 (12) : 5151 - 5161
  • [29] Fixed-Parameter Tractability of Graph Isomorphism in Graphs with an Excluded Minor
    Lokshtanov, Daniel
    Pilipczuk, Marcin
    Pilipczuk, Michal
    Saurabh, Saket
    PROCEEDINGS OF THE 54TH ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING (STOC '22), 2022, : 914 - 923
  • [30] A large database of graphs and its use for benchmarking graph isomorphism algorithms
    De Santo, M
    Foggia, P
    Sansone, C
    Vento, M
    PATTERN RECOGNITION LETTERS, 2003, 24 (08) : 1067 - 1079