International Journal of Combinatorics

Volume 2011, Article ID 101928, 15 pages

http://dx.doi.org/10.1155/2011/101928

## Binary Representations of Regular Graphs

Department of Mathematics, Central Michigan University, Mount Pleasant, MI 48859, USA

Received 17 January 2011; Accepted 2 August 2011

Academic Editor: Hajo Broersma

Copyright © 2011 Yury J. Ionin. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

#### Abstract

For any 2-distance set in the *n*-dimensional binary Hamming space , let be the graph with as the vertex set and with two vertices adjacent if and only if the distance between them is the smaller of the two nonzero distances in .
The binary spherical representation number of a graph , or bsr(), is the least *n* such that is isomorphic to , where is a 2-distance set lying on a sphere in . It is shown that if is a connected regular graph, then bsr, where *b* is the order of and *m* is the multiplicity of the least eigenvalue of , and the case of
equality is characterized. In particular, if is a connected strongly regular graph, then
bsr if and only if is the block graph of a quasisymmetric 2-design. It is also shown that if a connected regular graph is cospectral with a line graph and has the same binary spherical representation number as this line graph, then it is a line graph.