Table of Contents
International Journal of Combinatorics
Volume 2011 (2011), Article ID 101928, 15 pages
http://dx.doi.org/10.1155/2011/101928
Research Article

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.

Linked References

  1. P. J. Cameron and J. H. van Lint, Designs, Graphs, Codes and Their Links, Cambridge University Press, Cambridge, UK, 1991.
  2. A. Roy, β€œMinimal Euclidean representations of graphs,” Discrete Mathematics, vol. 310, no. 4, pp. 727–733, 2010. View at Publisher Β· View at Google Scholar Β· View at Zentralblatt MATH
  3. E. R. van Dam and W. H. Haemers, β€œWhich graphs are determined by their spectrum?” Linear Algebra and Its Applications, vol. 373, pp. 241–272, 2003. View at Publisher Β· View at Google Scholar Β· View at Zentralblatt MATH Β· View at MathSciNet
  4. Y. J. Ionin and M. S. Shrikhande, Combinatorics of Symmetric Designs, Cambridge University Press, Cambridge, UK, 2006.
  5. D. Cvetković, P. Rowlinson, and S. K. Simić, β€œSignless Laplacians of finite graphs,” Linear Algebra and Its Applications, vol. 423, no. 1, pp. 155–171, 2007. View at Publisher Β· View at Google Scholar Β· View at Zentralblatt MATH Β· View at MathSciNet
  6. I. J. Schoenberg, β€œRemarks to Maurice Fréchets article sur la definition axiomatique dune classe despace distanciés vectoriellement applicable sur lespace de Hilbert,” Annals of Mathematics, vol. 36, no. 3, pp. 724–732, 1935. View at Publisher Β· View at Google Scholar Β· View at MathSciNet
  7. L. M. Blumenthal, Theory and Applications of Distance Geometry, Oxford University Press, Oxford, UK, 1953.
  8. A. E. Brouwer, β€œStrongly regular graphs,” in The CRC Handbook of Combinatorial Designs, C. J. Colbourn and J. H. Dinitz, Eds., pp. 852–867, CRC Press, Boca Raton, Fla, USA, 2nd edition.
  9. D. M. Cvetković, M. Doob, and H. Sachs, Spectra of Graphs: Theory and Applications, John Wiley & Sons, New York, NY, USA, 1998.
  10. J. M. Goethals and J. J. Seidel, β€œStrongly regular graphs derived from combinatorial designs,” Canadian Journal of Mathematics, vol. 22, pp. 597–614, 1970. View at Google Scholar Β· View at Zentralblatt MATH
  11. D. M. Cvetković, M. Doob, I. Gutman, and A. Torgašev, Recent Results in the Theory of Graph Spectra, vol. 36 of Annals of Discrete Mathematics, North-Holland, Amsterdam, The Netherlands, 1988.
  12. L. W. Beineke, β€œCharacterizations of derived graphs,” Journal of Combinatorial Theory, vol. 9, pp. 129–135, 1970. View at Google Scholar Β· View at Zentralblatt MATH