On the independence number of distance graphs with vertices in {-1,0,1} n

被引：3

作者：

Guterman, A. E. ^{[1
]}

Lyubimov, V. K. ^{[1
]}

Raigorodskii, A. M. ^{[1
]}

Usachev, S. A. ^{[1
]}

机构：

[1] Moscow MV Lomonosov State Univ, Moscow, Russia

来源：

基金：

俄罗斯基础研究基金会;

关键词：

distance graph; independence number; incidence matrix; degree of a vertex;

D O I：

10.1134/S0001434609110169

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

[No abstract available]

引用

页码：744 / 746

页数：3

共 7 条

[1] [Anonymous], 2008, Surveys in contemporary mathematics, London Math. Soc. Lecture Note Ser.
[2] Bellman R., 1960, Introduction to Matrix Analysis
[3] BOLTYANSKI V., 1997, Excursions into Combinatorial Geometry
[4] BOLTYANSKII VG, 1965, THEOREMS PROBLEMS CO
[5] BRASS P, 2005, RES PROBLEMS DISCRET, DOI DOI 10.1007/0-387-29929-7
[6] Raigorodskii A. M., 2007, LINEAR ALGEBRAIC MET
[7] Borsuk's problem and the chromatic numbers of some metric spaces
Raigorodskii, AM
[J]. RUSSIAN MATHEMATICAL SURVEYS, 2001, 56 (01) : 103 - 139