
TL;DR
This paper introduces a new class of orthogonal graphs over modular integers of powers of two, classifies their regularity, computes parameters, and analyzes their symmetry, automorphisms, and coloring properties.
Contribution
It defines and studies orthogonal graphs over rac{2^n}{} for the first time, classifying their regularity and determining their automorphism groups and chromatic numbers.
Findings
The graphs are strongly regular or quasi-strongly regular with explicitly computed parameters.
The graphs are arc transitive, indicating high symmetry.
The chromatic number is determined except in specific cases.
Abstract
In this work, we define an orthogonal graph on the set of equivalence classes of tuples over where and are positive integers and or . 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 and is odd is determined. Moreover, we work on subconstituents of this orthogonal graph.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Orthogonal graphs modulo power of
Songpon Sriwongsa
Songpon Sriwongsa
Department of Mathematics
Faculty of Science
King Mongkut’s University of Technology Thonburi(KMUTT)
Bangkok 10140, Thailand
[email protected], [email protected]
Abstract.
In this work, we define an orthogonal graph on the set of equivalence classes of tuples over where and are positive integers and or . 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 and is odd is determined. Moreover, we work on subconstituents of this orthogonal graph.
Key words and phrases:
Graph automorphisms; Orthogonal graphs; Quasi-strongly regular graphs.
2010 Mathematics Subject Classification:
Primary: 05C25; Secondary: 05C60
1. Introduction
Graphs defined from the geometry of classical groups over finite fields have been widely studied. The collinearity graphs of finite classical polar spaces and their complements are well known strongly regular graphs [1, 9]. For more details about strongly regular graphs, the reader is referred to [2]. Orthogonal graphs over finite fields of odd characteristic using the geometry of orthogonal group and automorphisms of the graphs were studied in [3, 14]. Then, in [6, 7], subconstituents of these orthogonal graphs were analyzed. Li et al. [13] studied the orthogonal graphs over Galois rings of odd characteristic using matrix theory over finite Galois rings. Recently, Meemark and Sriwongsa extended this work to the orthogonal graphs finite commutative rings of odd characteristic [18]. The analogous series of symplectic graphs and their subconstituents were presented in [4, 5, 10, 11, 12, 14, 15, 16, 17, 19]. Motived by these references, in this paper, we consider the analogous problems of the orthogonal graphs modulo power of which is a generalization of the orthogonal graph over a finite field [20].
The paper is organized as follows. We define and study orthogonal graphs modulo power of in Section 2. This includes the computation on number of vertices , degree, common neighbors and chromatic numbers. We also analyze arc transitivity and automorphism groups of the graphs. In Section 3, subconstituents of the orthogonal graphs modulo power of are studied. We use similar technique as in Section 2 to determine all parameters of these subconstituents.
2. Orthogonal graphs modulo
Let be a positive integer. For and or , let denote the set of - tuples of elements in such that is invertible modulo for some . Define an equivalence relation on by
[TABLE]
for some . Here is the unit group modulo . Write for the equivalence class of modulo , and let be the set of all such equivalent classes. Let be the matrix over given by
[TABLE]
where
[TABLE]
and is a fixed element of not in , or equivalently, because and .
The orthogonal graph modulo on , denoted by , is the graph whose vertex set is and its adjacency condition is given by
[TABLE]
To see that this adjacency condition is well defined, let and assume that and . Then and for some . Thus, we have
[TABLE]
It is obvious that this orthogonal graph is a generalization of the orthogonal graph over defined similarly in [20].
We recall that is a finite local ring with the unique maximal ideal and the residue . Therefore, is a unit in for all and . Moreover, . The following lemma is an important property of a vertex of .
Lemma 2.1**.**
If is a vertex in , then for some .
Proof.
The result is directed when . If and , then
[TABLE]
implies is also an element in which is a contradiction. Now assume that and . Then
[TABLE]
implies and so in the residue field . This forces that , which is impossible. ∎
Since is the residue field of , the matrix over induces the matrix over in an obvious manner via the canonical map . It follows that
[TABLE]
for all . Here, we write
[TABLE]
for all . In the following lemma, we show that the results on counting all parameters of the orthogonal graph over can be considered as lifts from the graphs over its residue field .
Lemma 2.2**.**
(Lifting Lemma) By the above setting, we have the following.
- (1)
If is a vertex of , then there are many vertices which are lifts of vertex of , i.e. . 2. (2)
* and are adjacent vertices in if and only if and are adjacent vertices in .* 3. (3)
If and are adjacent vertices in , then and are adjacent vertices in the graph for all such that
[TABLE]
Proof.
It is clear that (2) follows from the above discussion and (3) is a consequence of (2). Now, we note that for each vertex of such that , must equal for some . So we assume that . Then for some . Thus, . This implies by Lemma 2.1, so for some . Hence, . Next, we remark that for all , and . Therefore, the number of elements in the set is . However, the is also required that . Write . By Lemma 2.1, is a unit for some . The requirement and is a unit allow us to count the number of possible vectors and it is easy to see that . This completes the proof of the lemma. ∎
A strongly regular graph with parameters is a -regular graph on vertices such that for every pair of adjacent vertices there are vertices adjacent to both, and for every pair of non-adjacent vertices there are vertices adjacent to both. An -regular graph on vertices such that for every pair of adjacent vertices there are vertices adjacent to both is called a quasi-strongly regular with parameters if every pair of non-adjacent vertices of has common adjacent vertices for some .
From the work of Wan and Zhou (Theorem 2.4 of [20]), it follows that the orthogonal graph is -regular on many vertices. Moreover, if , then it is a complete graph, and if , then the graph is a strongly regular graph with parameters
[TABLE]
respectively.
In what follows, we classify our orthogonal graph and it turns out that the graph is quasi-strongly regular when . In the proof of the next theorem, we use the lifting lemma with some combinatorial arguments without solving any complicated equations.
Theorem 2.3**.**
The graph is -regular on
[TABLE]
many vertices. Moreover,
- (1)
If , then it is a strongly regular graph with parameters
[TABLE]
respectively. 2. (2)
If , then it is a quasi-strongly regular graph with parameters
[TABLE]
respectively.
Proof.
We first note that every vertex of can be viewed as a vertex of via the canonical map . By Lemma 2.2 (1), each vertex of can be lifted to vertices in . Thus the number of vertices of is
[TABLE]
Since the graph is -regular, Lemma 2.2 implies that the graph is also regular of degree
Next, we consider the case . Since the graph is complete, for each pair of adjacent vertices in the graph , there are
[TABLE]
common neighbors by Lemma 2.2 (3). If , then is a path on two vertices and so is . Hence . Now, suppose that . Any two of non-adjacent vertices are of the forms and for some and such that . Thus, for every pair of non-adjacent vertices, the number of common neighbors equals the degree of regularity of by Lemma 2.2 (3), so we have .
Finally, we assume that . For each pair of adjacent vertices and in the graph , the number of common neighbors is given by the product of the common neighbors of vertices and and by Lemma 2.2. Thus,
[TABLE]
Assume that and are non-adjacent vertices in . If , then and are non-adjacent vertices in , so the number of common neighbors of and is the product of common neighbors of and and which equals by Lemma 2.2. If , the number of common neighbors is the degree of regularity of by a similar reason to the last sentence of the previous paragraph. ∎
A graph is vertex transitive if its automorphism group acts transitively on the vertex set. That is, for any two vertices of , there is an automorphism carrying one to the other. An arc in is an ordered pair of adjacent vertices, and is arc transitive if its automorphism group acts transitively on its arcs.
Lemma 2.4**.**
(See [20].) The orthogonal graph is vertex transitive and arc transitive.
For any set , we denote the set of all permutations of by . For any vertex of , let
[TABLE]
This is the set of all vertex in which are the lifts of the vertex of and . It is easy to see that each permutation in can be regard as an automorphism of our graph. Then we have:
Theorem 2.5**.**
The orthogonal graph is vertex transitive and arc transitive.
Proof.
It suffices to show that is arc transitive. Let be vertices of such that
[TABLE]
By applying four suitable permutations, we may assume that . Note that vertices in correspond with in , respectively. By Lemma 2.4, the result follows directly. ∎
Next, we determine the automorphism group of the orthogonal graph which is another application of the lifting lemma.
Theorem 2.6**.**
The automorphism group of the graph is given by
[TABLE]
where is determined in [20].
Proof.
By Lemma 2.2, the graph is isomorphic to a subgraph of . Then each automorphism of corresponds with an automorphism of the graph and a permutation of vertices in the set for all vertices . Thus,
[TABLE]
because and . ∎
Finally, we study chromatic number of orthogonal graph , where and or except when and is odd. The chromatic number is the smallest number of colors needed to color the vertices of the graph so that no two adjacent vertices share the same color. For convenience, we let .
Let . According to Wan and Zhou [20], the result of the graph is completely known and is isomorphic to the symplectic graph . From the proof of Proposition 2.7 along with Proposition 2.9 in [20], and Proposition 2.3 in [19], it follows that is a partite graph. Moreover, the chromatic number of is . Now, by Lemma 2.2, we know that is a partite graph as well. Then its chromatic number is at most . On the other hand, we consider the subgraph of which is isomorphic to . Clearly, its chromatic number is . Therefore, the chromatic number of is exactly and we record in the following theorem.
Theorem 2.7**.**
For , the chromatic number of the orthogonal graph is .
3. Subconstituents of graphs
In this section, two subconstituents of our orthogonal graphs are studied. This topic for such subconstituents over a finite field of characteristic two, in particular over , is presented in [8]. We use the analog method of [18] together with our lifting lemma (Lemma 2.2) to obtain the results for these subconstituents.
Let denote the vector . From Theorem 2.3, we know that our orthogonal graphs are either strongly regular or quasi-strongly regular. Thus, the distance or if . We work on the subconstituents , which are defined to be the induced subgraphs of on the vertex sets
[TABLE]
, respectively. Due to the definition, consists of all adjacent vertices of while consists of all non-adjacent vertices of . We observe that it is possible to define another subconstituents associated with other vertices. However, our graph is vertex and arc transitive by Theorem 2.5. Therefore, it suffices to consider only the ones associated with .
Lemma 3.1**.**
For , we have the following statements.
- (1)
If is a vertex of , then there are many vertices in which are lifts of vertex of . 2. (2)
* and are adjacent vertices in if and only if and are adjacent vertices in .* 3. (3)
If and are adjacent vertices in , then and are adjacent vertices in the graph for all such that
[TABLE]
Proof.
The proof is analogous to the proof of Lemma 2.2 since is adjacent to if and only if is adjacent to . ∎
The results of are known and presented in Theorem 3.9 and Theorem 4.3 of [8] when or . Since the graph is isomorphic to the symplectic graph [20], its subconstituents have been studied in [10]. Applying these two results together with the above lemma lead us to the following two theorems for subconstituents . Their proofs use similar argument to Theorem 2.3’s.
Theorem 3.2**.**
If or , then the subconstituent is a quasi-strongly regular graph with parameters where
[TABLE]
If , then the subconstituent is a - regular graph with many vertices where any two adjacent vertices have [math] or common neighbors and any two non-adjacent vertices have or common neighbors.
Theorem 3.3**.**
If or , then the subconstituent is a strongly regular with parameters where
[TABLE]
Moreover, for , the subconstituent is a quasi-strongly regular with parameters where
[TABLE]
If , then the subconstituent is a strongly regular with parameters
[TABLE]
Moreover, for , the subconstituent is a - regular graph with many vertices where any two adjacent vertices have common neighbors and any two non-adjacent vertices have or common neighbors.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] A.E. Brouwer, J.H. van Lint, Strongly regular graphs and partial geometries, in: D.M. Jackson, S.A. Vanstone (Eds.), Enumeration and Design, Academic Press, 1984, 85–122.
- 2[2] C. Godsil, G. Royle, Algebraic Graph Theory, Springer-Verlag, 2001.
- 3[3] Z. Gu, Z. Wan, Orthogonal graphs of odd characteristic and their automorphisms, Finite Fields Appl. 14 (2008) 291–313.
- 4[4] Z. Gu, Subconstituents of sympletic graphs modulo p n superscript 𝑝 𝑛 p^{n} , Linear Algebra Appl. 439 (2013) 1321–1329.
- 5[5] Z. Gu, Z. Wan, Automorphisms of subconstituents of symplectic graphs, Algebra Colloq. 20 (2013) 333–342.
- 6[6] Z. Gu, Z. Wan, K. Zhou, Subconstituents of orthogonal graphs of odd characteristic, Linear Algebra Appl. 434 (2011) 2430–2447.
- 7[7] Z. Gu, Z. Wan, K. Zhou, Subconstituents of orthogonal graphs of odd characteristic-continued, Linear Algebra Appl. 439 (2013) 2861–2877.
- 8[8] Z. Gu, Z. Wan, K. Zhou, Subconstituents of orthogonal graphs of characteristic 2 2 2 , Linear Algebra Appl. 507 (2016) 251–266.
