A platform for research: civil engineering, architecture and urbanism
A platform for research: civil engineering, architecture and urbanism
On the independence number of distance graphs with vertices in {?1, 0, 1} n
On the independence number of distance graphs with vertices in {?1, 0, 1} n
On the independence number of distance graphs with vertices in {?1, 0, 1} n
Guterman, A. (author) / Lyubimov, V. K. (author) / Raigorodskii, A. M. (author) / Usachev, S. A. (author)
MATHEMATICAL NOTES -NEW YORK- C/C OF MATEMATICHESKIE ZAMETIK ; 86 ; 744-746
2009-01-01
3 pages
Article (Journal)
English
DDC:
510
© Metadata Copyright the British Library Board and other contributors. All rights reserved.
New lower bounds for the independence numbers of distance graphs with vertices in {−1, 0, 1} n
| British Library Online Contents | 2011
Independence numbers of random subgraphs of distance graphs
| British Library Online Contents | 2016
| British Library Online Contents | 2014
Distance graphs with large chromatic number and without large cliques
| British Library Online Contents | 2010
Propositions on the Number of Confluence Vertices in Distribution Networks
| Online Contents | 2016