Orthogonal graphs modulo power of 2
classification
🧮 math.CO
math.RA
keywords
graphdeltaorthogonalregularworkautomorphismschromaticclasses
read the original abstract
In this work, we define an orthogonal graph on the set of equivalence classes of $(2\nu + \delta)-$tuples over $\mathbb{Z}_{2^n}$ where $n$ and $\nu$ are positive integers and $\delta = 0, 1$ or $2$. We classify our graph if it is strongly regular or quasi-strongly regular and compute all parameters precisely. We show that our graph is arc transitive. The automorphisms group is given and the chromatic number of the graph except when $\delta = 0$ and $\nu$ is odd is determined. Moreover, we work on subconstituents of this orthogonal graph.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.