| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6871192 | Discrete Applied Mathematics | 2018 | 7 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Danila Cherkashin, Anatoly Kulikov, Andrei Raigorodskii,