The gewirtz graph: An exercise in the theory of graph spectra

69Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We prove that there is a unique graph (on 56 vertices) with spectrum 101235(-4)20 and examine its structure. It turns out that, e.g., the Coxeter graph (on 28 vertices) and the Sylvester graph (on 36 vertices) are induced subgraphs. We give descriptions of this graph. © 1993 Academic Press, Inc.

Cite

CITATION STYLE

APA

Brouwer, A. E., & Haemers, W. H. (1993). The gewirtz graph: An exercise in the theory of graph spectra. European Journal of Combinatorics, 14(5), 397–407. https://doi.org/10.1006/eujc.1993.1044

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free