Lower bounds for the independence numbers of some distance graphs with vertices in {−1, 0, 1} n

2009 ◽  
Vol 80 (1) ◽  
pp. 547-549 ◽  
Author(s):  
V. K. Lyubimov ◽  
A. M. Raigorodskii
Keyword(s):  
Lower Bounds ◽  
Distance Graphs ◽  
Independence Numbers

Independence numbers and chromatic numbers of some distance graphs

2015 ◽  
Vol 51 (2) ◽  
pp. 165-176 ◽  
Author(s):  
A. V. Bobu ◽  
O. A. Kostina ◽  
A. E. Kupriyanov
Keyword(s):  
Chromatic Numbers ◽  
Distance Graphs ◽  
Independence Numbers

On the Independence Numbers of Some Distance Graphs with Vertices in {–1, 0, 1}n*

2019 ◽  
Vol 99 (2) ◽  
pp. 165-166 ◽  
Author(s):  
A. M. Raigorodskii ◽  
E. D. Shishunov
Keyword(s):  
Distance Graphs ◽  
Independence Numbers

scholarly journals On the independence numbers of some distance graphs with vertices in {-1, 0, 1}^n

2019 ◽  
Vol 485 (3) ◽  
pp. 269-271
Author(s):  
A. M. Raigorodskii ◽  
E. D. Shishunov
Keyword(s):  
Distance Graphs ◽  
Independence Numbers

New estimates for the independence numbers of distance graphs with vertices in B {-1, 0, 1}n are obtained.

scholarly journals On The Independence Number Of Some Strong Products Of Cycle-Powers

2015 ◽  
Vol 40 (2) ◽  
pp. 133-141 ◽  
Author(s):  
Marcin Jurkiewicz ◽  
Marek Kubale ◽  
Krzysztof Ocetkiewicz
Keyword(s):  
Lower Bounds ◽  
Independence Number ◽  
Computational Results ◽  
Shannon Capacity ◽  
Noisy Channels ◽  
Running Time ◽  
The Third ◽  
Independence Numbers

Abstract In the paper we give some theoretical and computational results on the third strong power of cycle-powers, for example, we have found the independence numbers α((C102)√3) = 30 and α((C144)√3) = 14. A number of optimizations have been introduced to improve the running time of our exhaustive algorithm used to establish the independence number of the third strong power of cycle-powers. Moreover, our results establish new exact values and/or lower bounds on the Shannon capacity of noisy channels.

On the Independence Numbers of Distance Graphs with Vertices in {–1, 0, 1}n

2019 ◽  
Vol 100 (2) ◽  
pp. 476-477
Author(s):  
A. M. Raigorodskii ◽  
E. D. Shishunov
Keyword(s):  
Distance Graphs ◽  
Independence Numbers

Independence numbers and chromatic numbers of the random subgraphs of some distance graphs

2015 ◽  
Vol 206 (10) ◽  
pp. 1340-1374 ◽  
Author(s):  
L I Bogolubsky ◽  
A S Gusev ◽  
M M Pyaderkin ◽  
A M Raigorodskii
Keyword(s):  
Chromatic Numbers ◽  
Distance Graphs ◽  
Random Subgraphs ◽  
Independence Numbers
Sign in / Sign up

Export Citation Format

Share Document