CONNECTIVITY AT INFINITY FOR STATE SPACES OF COMPLETE BIPARTITE GRAPHS

被引:0
|
作者
Mazur, Kristen [1 ]
McCammond, Jon [2 ]
Meier, John [3 ]
Rohatgi, Ranjan [4 ]
机构
[1] Elon Univ, Dept Math & Stat, Elon, NC 27244 USA
[2] Univ Calif Santa Barbara, Dept Math, Santa Barbara, CA 93106 USA
[3] Lafayette Coll, Dept Math, Easton, PA USA
[4] St Marys Coll, Dept Math & Comp Sci, Notre Dame, IN 46556 USA
关键词
graph braid groups; topology at infinity; CHESSBOARD; HOMOLOGY; TOPOLOGY;
D O I
10.1216/rmj.2022.52.667
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
The state or configuration space for r vertices on a complete bipartite graph K-m,K-n is a CAT(0) cube complex, which is sometimes interpreted as a parameter space for r robots moving on a K-m,K-n. We combine an analysis of the topology of links of vertices in this complex, the description of a hidden symmetry among the parameters, and known results from the literature to explicitly compute the exact degree to which the universal covers of these complexes are connected at infinity.
引用
收藏
页码:667 / 686
页数:20
相关论文
共 50 条
  • [41] Complete Graphs and Bipartite Graphs in a Random Graph
    Feng, Lijin
    Barr, Jackson
    2021 5TH INTERNATIONAL CONFERENCE ON VISION, IMAGE AND SIGNAL PROCESSING (ICVISP 2021), 2021, : 259 - 266
  • [42] Bipartite graphs and digraphs with maximum connectivity
    Fabrega, J
    Fiol, MA
    DISCRETE APPLIED MATHEMATICS, 1996, 69 (03) : 271 - 279
  • [43] On Extremal Bipartite Graphs with a Given Connectivity
    Chen, Hanlin
    Deng, Hanyuan
    Wu, Renfang
    FILOMAT, 2019, 33 (06) : 1531 - 1540
  • [44] Matching graphs of hypercubes and complete bipartite graphs
    Fink, Jiri
    EUROPEAN JOURNAL OF COMBINATORICS, 2009, 30 (07) : 1624 - 1629
  • [45] Complete bipartite graphs deleted in Ramsey graphs
    Li, Yan
    Li, Yusheng
    Wang, Ye
    THEORETICAL COMPUTER SCIENCE, 2020, 840 : 212 - 218
  • [46] On bisections of graphs without complete bipartite graphs
    Hou, Jianfeng
    Wu, Shufei
    JOURNAL OF GRAPH THEORY, 2021, 98 (04) : 630 - 641
  • [47] DECOMPOSITION OF RANDOM GRAPHS INTO COMPLETE BIPARTITE GRAPHS
    Chung, Fan
    Peng, Xing
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2016, 30 (01) : 296 - 310
  • [48] On the connectivity and superconnectivity of bipartite digraphs and graphs
    Balbuena, C
    Carmona, A
    ARS COMBINATORIA, 2001, 61 : 3 - 21
  • [49] Eccentric connectivity coindex of bipartite graphs
    Vetrik, Tomas
    Masre, Mesfin
    Balachandran, Selvaraj
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2023, 15 (01)
  • [50] On the complexity of construction of complete and complete bipartite graphs
    Zaytsev, D. V.
    DISCRETE MATHEMATICS AND APPLICATIONS, 2008, 18 (03): : 251 - 269