This paper is devoted to the study of the graph sequence Gn=(Vn,En), where Vn is the set of all vectors v∈Rn with coordinates in {−1,0,1} such that |v|=3 and En consists of all pairs of vertices with scalar product 1. We find the exact value of the independence number of Gn. As a corollary we get new lower bounds on χ(Rn) and χ(Qn) for small values of n.

Original languageEnglish
Pages (from-to)125-131
Number of pages7
JournalDiscrete Applied Mathematics
Volume243
DOIs
StatePublished - 10 Jul 2018

    Scopus subject areas

  • Applied Mathematics
  • Discrete Mathematics and Combinatorics

    Research areas

  • Chromatic number, Distance graphs, Independence number, R-N, SETS

ID: 36097989