Retracts of infinite Hamming graphs

被引：5
|
作者：
Chastand, M
机构：
[1] I.A.E., Univ. Jean Moulin Lyon III, 69239 Lyon Cedex 2, 15, quai Claude Bernard
来源：
JOURNAL OF COMBINATORIAL THEORY SERIES B | 1997年 / 71卷 / 01期
关键词：
D O I：
10.1006/jctb.1997.1746
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
A Hamming graph is a Cartesian product of complete graphs. We show that (finite or infinite) quasi-median graphs, which are a generalization of median graphs, are exactly the retracts of Hamming graphs. This generalizes a result of Bandelt (1984, J. Graph Theory 8, 501-510) about median graphs, and improves a result of Wilkeit (1992, Discrete Math. 102, 191-218) and of Chung, Graham, and Saks (1989, Combinatorica 9, 111-131) about finite quasi-median graphs. (C) 1997 Academic Press.
引用
收藏
页码：54 / 66
页数：13
相关论文
共 50 条
  • [31] On a Conjecture Regarding Identification in Hamming Graphs
    Junnila, Ville
    Laihonen, Tero
    Lehtila, Tuomo
    [J]. ELECTRONIC JOURNAL OF COMBINATORICS, 2019, 26 (02):
  • [32] On the Acyclic Chromatic Number of Hamming Graphs
    Robert E. Jamison
    Gretchen L. Matthews
    [J]. Graphs and Combinatorics, 2008, 24 : 349 - 360
  • [33] Completely transitive codes in hamming graphs
    Giudici, M
    Praeger, CE
    [J]. EUROPEAN JOURNAL OF COMBINATORICS, 1999, 20 (07) : 647 - 661
  • [34] On existence of perfect bitrades in Hamming graphs
    Mogilnykh, I. Yu.
    Solov'eva, F. I.
    [J]. DISCRETE MATHEMATICS, 2020, 343 (12)
  • [35] On the acyclic chromatic number of Hamming graphs
    Jamison, Robert E.
    Matthews, Gretchen L.
    [J]. GRAPHS AND COMBINATORICS, 2008, 24 (04) : 349 - 360
  • [36] Partial Hamming graphs and expansion procedures
    Bresar, B
    [J]. DISCRETE MATHEMATICS, 2001, 237 (1-3) : 13 - 27
  • [37] Entanglement of free fermions on Hamming graphs
    Bernard, Pierre-Antoine
    Crampe, Nicolas
    Vinet, Luc
    [J]. NUCLEAR PHYSICS B, 2023, 986
  • [38] Hamming graphs and special LCD codes
    Fish, W.
    Key, J. D.
    Mwambene, E.
    Rodrigues, B. G.
    [J]. JOURNAL OF APPLIED MATHEMATICS AND COMPUTING, 2019, 61 (1-2) : 461 - 479
  • [39] Minimum supports of eigenfunctions of Hamming graphs
    Valyuzhenich, Alexandr
    [J]. DISCRETE MATHEMATICS, 2017, 340 (05) : 1064 - 1068
  • [40] Finding optimal routings in Hamming graphs
    Lim, TK
    Praeger, CE
    [J]. EUROPEAN JOURNAL OF COMBINATORICS, 2002, 23 (08) : 1033 - 1041
12345