Abstract

We introduce the notion of a t -graph and prove that regular 3-graphs are equivalent to cyclic antipodal 3-fold covers of a complete graph. This generalizes the equivalence of regular two-graphs and Taylor graphs. As a consequence, an equivalence between cyclic antipodal distance regular graphs of diameter 3 and certain rank 6 commutative association schemes is proved. New examples of regular 3-graphs are presented.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call