The Hermitian two-graph and its code Original Research Article

The two-graph code of the Hermitian two-graph image is investigated. By use of this code we show that if q≡3 (mod 8) there exists no strongly regular graph with valency q2(q−1)/2 in the switching class corresponding to image For q=5 the code is worked out in detail. We generate the weight enumerator and give an account for the code words of several weights. Here it follows that there is a unique regular graph with valency 50 in the switching class.