STRONG PRODUCTS OF KNESER GRAPHS

被引：7
|
作者：
KLAVZAR, S [1 ]
MILUTINOVIC, U [1 ]
机构：
[1] UNIV MARIBOR,PF,MARIBOR 62000,SLOVENIA
来源：
DISCRETE MATHEMATICS | 1994年 / 133卷 / 1-3期
关键词：
D O I：
10.1016/0012-365X(94)90037-X
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
Let G X H be the strong product of graphs G and H. We give a short proof that chi(G X H) greater-than-or-equal-to chi(G) + 2omega(H)-2. Kneser graphs are then used to demonstrate that this lower bound is sharp. We also prove that for every n greater-than-or-equal-to 2 there is an infinite sequence of pairs of graphs G and G' such that G' is not a retract of G while G' X K(n) is a retract of G X K(n).
引用
收藏
页码：297 / 300
页数：4
相关论文
共 50 条
  • [21] A Generalization of Kneser Graphs
    Bobu, A., V
    Kupriyanov, A. E.
    Raigorodskii, A. M.
    MATHEMATICAL NOTES, 2020, 107 (3-4) : 392 - 403
  • [22] On the strong metric dimension of the strong products of graphs
    Kuziak, Dorota
    Yero, Ismael G.
    Rodriguez-Velazquez, Juan A.
    OPEN MATHEMATICS, 2015, 13 (01): : 64 - 74
  • [23] The diameter of strong orientations of strong products of graphs
    Ladinek, Irena Hrastnik
    Spacapan, Simon
    QUAESTIONES MATHEMATICAE, 2021, 44 (07) : 945 - 958
  • [24] The energy of q-Kneser graphs and attenuated q-Kneser graphs
    Lv, Benjian
    Wang, Kaishun
    DISCRETE APPLIED MATHEMATICS, 2013, 161 (13-14) : 2079 - 2083
  • [25] Tensor products and strong products of soft graphs
    George, Bobin
    Jose, Jinta
    Thumbakara, Rajesh K.
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2023, 15 (08)
  • [26] On the boxicity of Kneser graphs and complements of line graphs
    Caoduro, Marco
    Lichev, Lyuben
    DISCRETE MATHEMATICS, 2023, 346 (05)
  • [27] L(2,1)-Labeling of Kneser graphs and coloring squares of Kneser graphs
    Shao, Zhendong
    Averbakh, Igor
    Solis-Oba, Roberto
    DISCRETE APPLIED MATHEMATICS, 2017, 221 : 106 - 114
  • [28] BIPARTITE KNESER GRAPHS ARE HAMILTONIAN
    Muetze, Torsten
    Su, Pascal
    COMBINATORICA, 2017, 37 (06) : 1207 - 1219
  • [29] Sparse Kneser Graphs Are Hamiltonian
    Muetze, Torsten
    Nummenpalo, Jerri
    Walczak, Bartosz
    STOC'18: PROCEEDINGS OF THE 50TH ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING, 2018, : 912 - 919
  • [30] The equitable colorings of Kneser graphs
    Chen, Bor-Liang
    Huang, Kuo-Ching
    TAIWANESE JOURNAL OF MATHEMATICS, 2008, 12 (04): : 887 - 900
12345