Connectedness of finite distance graphs

被引：2
|
作者：
Gomez-Perez, Domingo [2 ]
Gutierrez, Jaime [1 ]
Ibeas, Alvar [1 ]
机构：
[1] Univ Cantabria, Dep Matemat Aplicada CC Comp, E-39005 Santander, Spain
[2] Univ Cantabria, Dep Matemat Estadist & Comp, E-39005 Santander, Spain
来源：
NETWORKS | 2012年 / 60卷 / 03期
关键词：
Distance graphs; circulant graphs; connectedness; TOEPLITZ GRAPHS; LOOP NETWORKS;
D O I：
10.1002/net.21465
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
We describe a polynomial-time algorithm for deciding whether a given distance graph with a finite number of vertices is connected. This problem was conjectured to be NP-hard in Draque Penso et al. (C) 2012 Wiley Periodicals, Inc. NETWORKS, 2012
引用
收藏
页码：204 / 209
页数：6
相关论文
共 50 条
  • [31] CONNECTIVITY AND HAMILTONIAN CONNECTEDNESS OF GRAPHS
    ZHU, YJ
    WANG, ZX
    CHINESE SCIENCE BULLETIN, 1993, 38 (01): : 15 - 18
  • [32] Distance from marker sequences in locally finite Borel graphs
    Conley, Clinton T.
    Marks, Andrew S.
    TRENDS IN SET THEORY, 2020, 752 : 89 - 92
  • [33] Finite two-distance-transitive graphs of valency 6
    Jin, Wei
    Tan, Li
    ARS MATHEMATICA CONTEMPORANEA, 2016, 11 (01) : 49 - 58
  • [34] Distance lending & social connectedness☆
    Kariya, Ankitkumar
    Shekhawat, Chhavi
    JOURNAL OF FINANCIAL STABILITY, 2024, 72
  • [35] The Distance Matching Extension in K1,k-free Graphs with High Local Connectedness
    Wei-chan Liu
    Gui-ying Yan
    Acta Mathematicae Applicatae Sinica, English Series, 2022, 38 : 37 - 43
  • [36] The Distance Matching Extension in K1,k-free Graphs with High Local Connectedness
    Liu, Wei-chan
    Yan, Gui-ying
    ACTA MATHEMATICAE APPLICATAE SINICA-ENGLISH SERIES, 2022, 38 (01): : 37 - 43
  • [37] The Distance Matching Extension in K1,k-free Graphs with High Local Connectedness
    Wei-chan LIU
    Gui-ying YAN
    Acta Mathematicae Applicatae Sinica, 2022, 38 (01) : 37 - 43
  • [38] On Distance in Some Finite Planes and Graphs Arising from Those Planes
    Dogan, I.
    Akpinar, A.
    JOURNAL OF MATHEMATICS, 2021, 2021
  • [39] Embedding bipartite distance graphs under Hamming metric in finite fields
    Xu, Zixiang
    Yu, Wenjun
    Ge, Gennian
    JOURNAL OF COMBINATORIAL THEORY SERIES A, 2023, 198
  • [40] On super connectedness and super restricted edge-connectedness of total graphs
    Tian, Yingzhi
    Meng, Jixiang
    ARS COMBINATORIA, 2014, 114 : 309 - 319
12345