Title of article :
Complementary ℓ1-Graphs Embeddable in the Half-Cube
Author/Authors :
Marcusanu، نويسنده , , M.C.، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2002
Pages :
12
From page :
1061
To page :
1072
Abstract :
A finite connected graph is called an ℓ1-graph if it can be isometrically embedded into the space ℓ1. We complete the classification of pairs of complementaryℓ1 -graphs started by Deza and Huang, and continued by Shpectorov.
Journal title :
European Journal of Combinatorics
Serial Year :
2002
Journal title :
European Journal of Combinatorics
Record number :
1550650
Link To Document :
بازگشت