Ivanov-Ivanov-Faradjev Graph

The Ivanov-Ivanov-Faradjev graph is a distance-regular graph on 990 vertices (Brouwer et al. 1989, p. 369). It has intersection array {7,6,4,4,4,1,1,1;1,1,1,2,4,4,6,7} and is also distance-transitive.

It is a weakly regular graph of order 7, and has graph spectrum


(van Dam and Haemers 2003).

The Ivanov-Ivanov-Faradjev graph is implemented in the Wolfram Language as GraphData["IvanovIvanovFaradjevGraph"].

See also

Cubic Semisymmetric Graph, Doubly Truncated Witt Graph, Iofinova-Ivanov Graphs, Large Witt Graph, Ljubljana Graph, Semisymmetric Graph, Truncated Witt Graph, Witt Design

Explore with Wolfram|Alpha


Brouwer, A. E.; Cohen, A. M.; and Neumaier, A. "The Ivanov-Ivanov-Faradjev Graph." §11.4D in Distance Regular Graphs. New York: Springer-Verlag, pp. 369-370, "Ivanov-Ivanov-Faradjev Graph.", I. A.; Ivanov, A. A.; and Ivanov, A. V. "Distance-Transitive Graphs of Valency 5, 6 and 7." Europ. J. Combin. 7, 303-319, 1986.van Dam, E. R. and Haemers, W. H. "Which Graphs Are Determined by Their Spectrum?" Lin. Algebra Appl. 373, 139-162, 2003.

Referenced on Wolfram|Alpha

Ivanov-Ivanov-Faradjev Graph

Cite this as:

Weisstein, Eric W. "Ivanov-Ivanov-Faradjev Graph." From MathWorld--A Wolfram Web Resource.

Subject classifications