Next Article in Journal
Construction of Inequalities for Network Quantum Steering Detection
Previous Article in Journal
Fuzzy Signature from Computational Diffie–Hellman Assumption in the Standard Model
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Full Automorphism Group of (m, 2)-Graph in Finite Classical Polar Spaces

1
Department of Mathematics and Physics, Shijiazhuang Tiedao University, Shijiazhuang 050043, China
2
School of Mathematical Sciences, Hebei Normal University, Shijiazhuang 050024, China
*
Author to whom correspondence should be addressed.
Axioms 2025, 14(8), 614; https://doi.org/10.3390/axioms14080614
Submission received: 2 July 2025 / Revised: 31 July 2025 / Accepted: 4 August 2025 / Published: 6 August 2025

Abstract

Let Q be the finite classical polar space of rank ν 1 over F q , and Q m be the set of all m-dimensional subspaces of Q . In this paper, we introduce the (m, 2)-graph with Q m as its vertex set, and two vertices P, Q are adjacent if and only if P + Q is an (m + 2)-dimensional subspace of Q . The full automorphism group of (m, 2)-graph is determined.
MSC:
05C60; 05E14

1. Introduction

Finite classical polar spaces arise from the classification of non-degenerate sesquilinear and nonsingular quadratic forms defined on vector spaces over a finite field. There are six fundamental types of forms to consider, which naturally induce three geometric structures. Alternating forms yield symplectic geometries, Hermitian forms generate unitary geometries, and quadratic forms produce orthogonal geometries. Given a form on a finite vector space V, all totally isotropic subspaces of V form the associated polar space Q . The rank of the polar space Q is defined as the dimension of its maximal subspaces. The collection of all m-dimensional subspaces of Q is denoted by Q m .
Table 1 classifies all isomorphism types of finite classical polar spaces with rank ν 1 over finite fields F q . The table specifies type symbols for each polar space class, dimension n of the corresponding projective space P G ( V ) , a uniformity parameter ϵ facilitating consistent enumeration across types, and the collineation group G. In particular, the Hermitian polar spaces only exist for squares q. For more details on finite classical polar spaces, readers can refer to [1,2,3].
The ( m , t ) -graph in finite classical polar spaces Q is the graph with Q m as its vertex set, and two vertices P , Q are adjacent if and only if P + Q is an ( m + t ) -dimensional subspace of Q . It is easy to verify that the union of ( m , 1 ) -graph and generalized symplectic, unitary or orthogonal graph is a Grassmann graph of the corresponding polar spaces. The properties and automorphism groups of generalized symplectic, unitary, and orthogonal graphs have been extensively studied by many scholars [4,5,6,7,8,9,10,11,12,13]. In this paper, we determine the full automorphism group of the ( m , 2 ) -graph. For convenience, we denote the ( m , 2 ) -graph in Q by Γ . There is an edge in graph Γ if and only if 2 m ν 2 . Therefore, we only consider these cases. The main theorems are as follows.
Theorem 1.
The graph Γ is a ( v , k ) -regular graph where
v = i = ν m + 1 ν ( q i 1 ) ( q i + ϵ + 1 ) i = 1 m ( q i 1 ) ,
and
k = q 4 i = m 1 m ( q i 1 ) i = ν m 1 ν m ( q i 1 ) ( q i + ϵ + 1 ) ( q 1 ) 2 ( q 2 1 ) 2 .
Theorem 2.
Let 2 m ν 2 ; the full automorphism group of the graph Γ is the collineation group G in Table 1, that is, every automorphism of Γ has the following form:
σ π , T : V ( Γ ) V ( Γ ) X π ( X ) T ,
where π Aut ( F q ) , π ( X ) = ( π ( x i j ) ) , and T belongs to the projective generalized classical group of the corresponding polar space.
In the following sections of this paper, we will take the symplectic polar space as an example and give proofs of Theorems 1 and 2. The cases on unitary and orthogonal polar spaces are similar. Section 2 introduces the preliminaries on the symplectic polar space. In Section 3, we investigate the properties of the ( m , 2 ) -graph in the symplectic polar space. Section 4 determines the full automorphism group of the ( m , 2 ) -graph. Finally, in Section 5, we summarize our work and propose two open questions for further research.

2. Preliminaries on the Symplectic Polar Space

Let K be an n × n nonsingular alternate matrix over F q . As we know, n is even. From now on, we assume that n = 2 ν . A 2 v × 2 ν matrix T over F q is called a symplectic matrix with respect to K if T K T T = K , where T T is the transpose of the matrix T. Clearly, 2 v × 2 ν symplectic matrices form a group with respect to the matrix multiplication, called the symplectic group of degree 2 ν with respect to K over F q and denoted by S p 2 ν ( F q , K ) . It is easy to verify that the symplectic groups of degree 2 ν with respect to different 2 v × 2 ν nonsingular alternate matrices are isomorphic. Thus, in discussing symplectic groups, without loss of generality, we can choose any particular 2 v × 2 ν nonsingular alternate matrix K. In this paper, let us take
K = 0 I ( ν ) I ( ν ) 0 ,
where I ( ν ) is the ν × ν identity matrix. Denote the symplectic group with respect to K simply by S p 2 ν ( F q ) . Consider the 2 ν -dimensional row vector space F q ( 2 ν ) over the finite field F q . The symplectic group S p 2 ν ( F q ) acts naturally on this space via right matrix multiplication, as expressed by the group action map:
F q ( 2 ν ) × S p 2 ν ( F q ) F q ( 2 ν ) ( α , T ) α T .
The vector space F q ( 2 ν ) , together with the above group action, forms the 2 ν -dimensional symplectic space over F q .
Let P denote an m-dimensional subspace of F q ( 2 ν ) . A matrix representation of P is any m × 2 ν matrix whose row space spans P. Note that such representations are unique up to left multiplication by invertible matrices. Two m × 2 ν matrices P 1 and P 2 of rank m represent the same subspace if and only if P 1 = Q P 2 for some Q G L m ( F q ) , denoted by P 1 P 2 . The m-dimensional subspace P is classified as type ( m , s ) if the rank of P K P T is 2 s , that is, rk ( P K P T ) = 2 s . The existence of such subspaces is constrained by the inequalities 2 s m ν + s [14]. Notably, when s = 0 , i.e., P K P T = 0 , P is called totally isotropic. The collection of all totally isotropic subspaces constitutes the symplectic polar space of rank ν , denoted by W 2 ν 1 ( q ) . For brevity, we still adopt Q for W 2 ν 1 ( q ) , Q m for the set of m-dimensional totally isotropic subspaces, and dim P for the dimension of P.
Lemma 1
([14]). ( i ) Let 1 m n . Then the number of m-dimensional vector subspaces of F q ( n ) is
N ( m , n ) = i = n m + 1 n ( q i 1 ) i = 1 m ( q i 1 ) .
(ii) The number of subspaces in Q m is equal to
N ( m , 0 , 2 ν ) = i = ν m + 1 ν ( q 2 i 1 ) i = 1 m ( q i 1 ) .
Lemma 2
([15]). ( i ) Let X , Y Q m , dim ( X Y ) = d and rk ( X K Y T ) = r . Then 0 d m 1 and
max { 0 , 2 m ν d } r m d .
( i i ) Let X 1 , Y 1 , X 2 , Y 2 Q m . Then dim ( X 1 Y 1 ) = dim ( X 2 Y 2 ) and rk ( X 1 K Y 1 T ) = rk ( X 2 K Y 2 T ) if and only if there exists T S p 2 ν ( F q ) such that X 2 = X 1 T and Y 2 = Y 1 T .
Let P Q m ; the number of vertices in the set
{ Q V ( Γ ) dim ( P Q ) = d , rk ( P K Q T ) = r }
is independent of the choice of P, since the symplectic group acts transitively on the subspaces of the same type. Denote this set by S ( d , r ) .
Lemma 3
([15]). Let 1 m ν , 0 d m 1 , max { 0 , 2 m ν d } r m d . Then the number of vertices in S ( d , r ) is
n ( d , r ) = N ( d , m ) N ( r , m d ) N ( m d r , 0 ; 2 ( ν m ) ) q 2 r ( ν m ) + ( m d r ) 2 + r ( r + 1 ) 2 .
The generalized symplectic graph G S p 2 ν ( q , m ) over F q is the graph with Q m as its vertex set, and two vertices P and Q are adjacent if and only if
dim ( P Q ) = m 1 and rk ( P K Q T ) = 1 .
To introduce the full automorphism group of G S p 2 ν ( q , m ) , we give the definition of the projective generalized symplectic group. The set of 2 ν × 2 ν matrices T over the finite field F q satisfying the condition T K T T = k K , where k F q * , forms the generalized symplectic group of degree 2 ν over F q with respect to the matrix multiplication, denoted by G S p 2 ν ( F q ) . The projective quotient P G S p 2 ν ( F q ) is obtained by factoring the G S p 2 ν ( F q ) modulo its central subgroup { k I ( 2 ν ) | k F q * } , called the projective generalized symplectic group.
Lemma 4
([6]). The full automorphism group of the generalized symplectic graph G S p 2 ν ( q , m ) is P Γ S p 2 ν ( q ) , that is, every automorphism of G S p 2 ν ( q , m ) has the following form:
σ π , T : V ( G S p 2 ν ( q , m ) ) V ( G S p 2 ν ( q , m ) ) X π ( X ) T ,
where π Aut ( F q ) , π ( X ) = ( π ( x i j ) ) , and T P G S p 2 ν ( F q ) .

3. Properties of ( m , 2 ) -Graph in the Symplectic Polar Space

The ( m , 2 ) -graph in the symplectic polar space Q is the graph Γ with Q m as its vertex set, and two vertices P , Q are adjacent if and only if P + Q is an ( m + 2 ) -dimensional totally isotropic subspace. From the conditions for the existence of an ( m , s ) subspace, it follows that there is an edge in the graph Γ if and only if 2 m ν 2 .
Since the symplectic group acts transitively on the subspaces of the same type, the graph Γ is vertex-transitive. It is obvious that the number of vertices in Γ is N ( m , 0 , 2 ν ) in Lemma 1, and the degree of each vertex is n ( m 2 , 0 ) in Lemma 3. By simple calculation, Theorem 1 is proved, where ϵ = 0 .
Let ( P , Q ) be the distance between two vertices P and Q in Γ . Denote by P Q when P and Q are adjacent, and P Q otherwise. For P V ( Γ ) , let Γ ( P ) be the set of neighbors of P. Then we have the following theorem.
Theorem 3.
Let 2 m ν 2 , P , Q be two vertices of Γ satisfying dim ( P Q ) = d and rk ( P K Q T ) = r ; then, ( P , Q ) = 2 if and only if
m 4 d m 1 , max { 0 , 2 m ν d } r min { 2 , m d } ,
where r 0 when d = m 2 .
Proof. 
Since the symplectic group is an automorphism group of Γ , without loss of generality, we can assume that
Axioms 14 00614 i001
where the numbers above the matrix are the numbers of columns. If dim ( P Q ) = d and rk ( P K Q T ) = r , then 0 d m 1 and
max { 0 , 2 m ν d } r m d
by Lemma 1, and we can choose a special vertex Q to compute its distance with P by Lemma 2. Next, let us discuss d with the following cases.
( i ) If d = m 1 , then 0 r 1 by 2 m ν 2 and
max { 0 , 2 m ν d } r min { 2 , m d } .
When r = 0 , we can assume that
Axioms 14 00614 i002
When r = 1 , we can assume that
Axioms 14 00614 i003
, that is, ( P , Q ) 2 . Let
Axioms 14 00614 i004
It is to easy to verify that P R Q ; thus, ( P , Q ) = 2 .
( i i ) If d = m 2 , then 0 r 2 .
When r = 0 , P Q , that is, ( P , Q ) = 1 .
When r = 1 or 2, similar to the discussion in case (i), we could find a vertex R satisfying P R Q for each special Q. Thus, ( P , Q ) = 2 .
( i i i ) If d = m 3 , then max { 0 , m + 3 ν } r 3 (this case occurs only when m 3 ).
When r = 0 , 1 or 2, similar to the discussion in case (i), we have ( P , Q ) = 2 .
When r = 3 , we can assume
Axioms 14 00614 i005
For each M Γ ( P ) , it has the following matrix representation
Axioms 14 00614 i006
where rk ( A 11 , A 12 ) = m 2 , and ( B 2 , D 2 ) Q 2 . Thus,
Axioms 14 00614 i007
Since rk ( A 11 , A 12 ) = m 2 and A 12 F q ( m 2 ) × ( m 3 ) , rk ( A 11 ) 1 . This means that 0 d i m ( M Q ) m 3 . Therefore, ( P , Q ) > 2 . In addition, let
Axioms 14 00614 i008
Axioms 14 00614 i009
where e 1 and e 2 are the first and second unit vectors, respectively. It is easy to verify that P R S Q , then ( P , Q ) = 3 .
( i v ) If d = m 4 , then max { 0 , m + 4 ν } r 4 (this case occurs only when m 4 ).
Similar to the discussion in case (iii), we have ( P , Q ) = 2 when r = 0 , 1 or 2, and ( P , Q ) = 3 when r = 3 or 4.
( i v ) If 0 d m 5 , then max { 0 , m + 5 ν } r 5 (this case occurs only when m 5 ).
Similar to the discussion in case (iii), we have ( P , Q ) > 2 .
Above all, ( P , Q ) = 2 if and only if d = m 1 , d = m 2 , or 0 r 2 when d = m 3 or m 4 . The theorem now follows. □
From the proof of the above theorem, we have the following corollary.
Corallary 1.
Let the diameter of Γ be d ( Γ ) . Then, d ( Γ ) = 2 when m = 2 , and d ( Γ ) = 3 when m = 3 or 4.

4. Automorphisms of ( m , 2 ) -Graph in the Symplectic Polar Space

In this section, we will determine the full automorphism group of the ( m , 2 ) -graph Γ in the symplectic polar space. For the given d and r, let P and Q be any two vertices of Γ satisfying dim ( P Q ) = d , rk ( P K Q T ) = r . Then, by Lemma 2, the number of common neighbors of P and Q is independent of the choice of P and Q, which is denoted by l ( d , r ) . We have the following theorem.
Theorem 4.
Let 2 m ν 2 , m 4 d m 1 ,
max { 0 , 2 m ν d } r min { 2 , m d } ,
where r 0 when d = m 2 . Then,
( i ) l ( m 1 , 0 ) l ( m 1 , 1 ) .
( i i ) l ( m 1 , t ) l ( d , r ) , where t = 0 or 1, d < m 1 .
Proof. 
The conditions that d and r satisfy are precisely those stated in Theorem 3. Without loss of generality, let
Axioms 14 00614 i010
If dim ( P Q ) = d and rk ( P K Q T ) = r as in the theorem, then ( P , Q ) = 2 . Suppose M Γ ( P ) , then M has the matrix representation
Axioms 14 00614 i011
where
rk ( M 11 , M 12 ) = m 2 , β 1 γ 1 β 2 γ 2 Q 2 .
l ( d , r ) is the number of common neighbors of P and Q, i.e., the number of vertices M such that Q M . Next, we will compute l ( d , r ) by choosing the special Q for each pair ( d , r ) .
When ( d , r ) = ( m 1 , 1 ) , let
Axioms 14 00614 i012
l ( m 1 , 1 ) is the number of M satisfying Q M . Q M if and only if
Axioms 14 00614 i013
This means that M 11 = 0 , a 1 = a 2 = 0 , and then
Axioms 14 00614 i014
where rk ( M 12 ) = m 2 . Therefore,
l ( m 1 , 1 ) = q 2 N ( m 2 , m 1 ) N ( 2 , 0 ; 2 ( ν m ) ) = q 2 ( q m 1 1 ) ( q 2 ( ν m 1 ) 1 ) ( q 2 ( ν m ) 1 ) ( q 1 ) 2 ( q 2 1 ) .
Through similar computations, we could get
l ( m 1 , 0 ) = q 3 ( q m 1 1 ) ( q 2 ( ν m 1 ) 1 ) q 1 + q 6 ( q m 1 1 ) ( q m 2 1 ) ( q 2 ( ν m 1 ) 1 ) ( q 1 ) 2 ( q 2 1 ) + q 6 ( q m 1 1 ) ( q 2 ( ν m 2 ) 1 ) ( q 2 ( ν m 1 ) 1 ) ( q 1 ) 2 ( q 2 1 ) .
l ( m 2 , 1 ) = q ( q 2 ( ν m 1 ) 1 ) + q 3 ( q m 2 1 ) ( q 2 ( ν m 1 ) 1 ) ( q 1 ) 2 + q 4 ( q 2 ( ν m 2 ) 1 ) ( q 2 ( ν m 1 ) 1 ) ( q 1 ) ( q 2 1 ) .
l ( m 2 , 2 ) = ( q 2 ( ν m 1 ) 1 ) ( q 2 ( ν m ) 1 ) ( q 1 ) ( q 2 1 ) .
l ( m 3 , 0 ) = ( q 2 + q + 1 ) 2 ( q 1 ) ( q + 1 ) 2 + ( q m 3 1 ) q 1 ( q 2 + q + 1 ) ( q 6 + q 5 + q 4 ) + q 4 ( q 2 + q + 1 ) 2 ( q 2 ( ν m 3 ) 1 ) ( q 1 ) .
l ( m 3 , 1 ) = q 4 ( q m 3 1 ) q 1 + ( q + 1 ) 2 ( q 1 ) + ( q 2 + q ) 2 ( q 2 ( ν m 2 ) 1 ) ( q 1 ) .
l ( m 3 , 2 ) = q 2 ( ν m 1 ) 1 ( q 1 ) , l ( m 4 , 0 ) = ( q 2 + q + 1 ) 2 ( 1 + q 2 ) 2 .
l ( m 4 , 1 ) = ( q 2 + q + 1 ) 2 , l ( m 4 , 2 ) = 1 .
Above all, we can verify that q 3 l ( m 1 , 0 ) , q 4 l ( m 1 , 0 ) , q 2 l ( m 1 , 1 ) , q 3 l ( m 1 , 1 ) , q 2 l ( d , r ) for d < m 1 . Then, the theorem follows. □
Finally, we present the proof of Theorem 2.
Proof of Theorem 2.
It is easy to verify that the group P Γ S p 2 ν ( q ) is an automorphism group of Γ . Conversely, let σ be an automorphism of Γ , and P , Q V ( Γ ) satisfies dim ( P Q ) = m 1 , rk ( P K Q T ) = 1 . Then, ( P , Q ) = 2 by Theorem 3. Since σ preserves the distance between two vertices in Γ , ( σ ( P ) , σ ( Q ) ) = 2 , and
| Γ ( P ) Γ ( Q ) | = | Γ ( σ ( P ) ) Γ ( σ ( Q ) ) | .
Therefore, dim ( σ ( P ) σ ( Q ) ) = m 1 , rk ( σ ( P ) K σ ( Q ) T ) = 1 by Theorem 4, which means that σ is also an automorphism of the generalized symplectic graph G S p 2 ν ( q , m ) . Thus, σ P Γ S p 2 ν ( q ) by Lemma 4. The theorem now follows. □

5. Conclusions and Further Study

In this paper, we introduce the ( m , t ) -graph in finite classical polar spaces. Taking the symplectic polar space as an example, we establish fundamental properties of the ( m , 2 ) -graph Γ , proving its regularity and characterizing distance metric, completely determining its full automorphism group. In the following study, we will consider the spectral properties of Γ , and examine whether similar results extend to the general ( m , t ) -graph with t 3 . These investigations will deepen the connections between finite geometry, algebraic graph theory, and group theory.

Author Contributions

Y.Z., S.L., and L.Z.: Conceptualization, Methodology, Validation, Writing—Original Draft, Writing—Review and Editing. All authors have read and agreed to the published version of the manuscript.

Funding

Research supported by NSFC (No.12171139).

Data Availability Statement

The original contributions presented in this study are included in the article. Further inquiries can be directed to the corresponding author.

Conflicts of Interest

All authors declare no conflicts of interest in this paper.

References

  1. Beule, J.D.; Klein, A.; Metsch, K. Substructures of finite classical polar spaces. In Current Research Topics in Galois Geometry; Storme, L., De Beule, J., Eds.; Mathematics Research Developments, Nova Science: Hauppauge, NY, USA, 2012; pp. 35–61. [Google Scholar]
  2. Ball, S. Finite Geometry and Combinatorial Applications, Number 82 in London Mathematical Society Student Texts; Cambridge University Press: Cambridge, UK, 2015. [Google Scholar]
  3. Brouwer, A.E.; Maldeghem, H.V. Strongly Regular Graphs, Encyclopedia of Mathematics and Its Applications; Cambridge University Press: Cambridge, UK, 2022; p. 182. [Google Scholar]
  4. Wan, Z.X.; Tang, Z.M. Symplectic graphs and their automorphisms. Eur. J. Combin. 2006, 27, 38–50. [Google Scholar]
  5. Tits, J. Buildings of Spherical Type and Finite BN-Pairs; Lecture Notes in Math; Springer: Berlin/Heidelberg, Germany, 1974; p. 386. [Google Scholar]
  6. Zeng, L.W.; Chai, Z.; Feng, R.Q.; Ma, C.L. Full autommrphism group of generalized symplectic group. Sci. China Math. 2013, 56, 1509–1520. [Google Scholar] [CrossRef]
  7. Wan, Z.X.; Zhou, K. Unitary graphs and their automorphisms. Ann. Comb. 2010, 14, 367–395. [Google Scholar] [CrossRef]
  8. Liu, W.; Ma, C.L.; Wang, K.S. Full automorphism group of generalized unitary graphs. Linear Algebra Appl. 2012, 437, 684–691. [Google Scholar] [CrossRef][Green Version]
  9. Gu, Z.H.; Wan, Z.X. Orthogonal graphs of odd characteristic and their automorphisms. Finite Fields Appl. 2008, 14, 291–313. [Google Scholar] [CrossRef][Green Version]
  10. Wan, Z.X.; Zhou, K. Orthogonal graphs of characteristic 2 and their automorphisms. Sci. China Ser. A 2009, 52, 361–380. [Google Scholar] [CrossRef]
  11. Li, F.G.; Wang, Y.X. Subconstituents of dual polar graph in finite classical space III. Linear Algebra Appl. 2002, 349, 105–123. [Google Scholar] [CrossRef][Green Version]
  12. Huo, L.J.; Guo, W.N.; Ma, C.L. Automorphisms of generalized orthogonal graphs with odd characteristic. Acta Math. Sin. Chin. Ser. 2014, 57, 71–88. [Google Scholar]
  13. Huo, L.J.; Guo, W.N.; Zhang, G.S. Automorphisms of generalized orthogonal graphs of characteristic 2. Front. Math. China 2014, 9, 303–319. [Google Scholar] [CrossRef]
  14. Wan, Z.X. Geometry of Classical Groups over Finite Fields; Science Press: Beijing, China; New York, NY, USA, 2002. [Google Scholar]
  15. Wei, H.Z.; Wang, Y.X. Suborbits of the transitive set of subspaces of type (m, 0) under finite classical groups. Algebra Colloq. 1996, 3, 73–84. [Google Scholar]
Table 1. Finite classical polar spaces of rank ν .
Table 1. Finite classical polar spaces of rank ν .
NameSymboln ϵ G
symplectic W 2 ν 1 ( q ) 2 ν 0 P Γ S p 2 ν ( q )
Hermitian U 2 ν 1 ( q ) 2 ν 1 / 2 P Γ U 2 ν ( q )
Hermitian U 2 ν ( q ) 2 ν + 1 1 / 2 P Γ U 2 ν + 1 ( q )
hyperbolic Q 2 ν 1 + ( q ) 2 ν 1 P Γ O 2 ν + ( q )
parabolic Q 2 ν ( q ) 2 ν + 1 0 P Γ O 2 ν + 1 ( q )
elliptic Q 2 ν + 1 ( q ) 2 ν + 2 1 P Γ O 2 ν + 2 ( q )
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Zhang, Y.; Liu, S.; Zeng, L. Full Automorphism Group of (m, 2)-Graph in Finite Classical Polar Spaces. Axioms 2025, 14, 614. https://doi.org/10.3390/axioms14080614

AMA Style

Zhang Y, Liu S, Zeng L. Full Automorphism Group of (m, 2)-Graph in Finite Classical Polar Spaces. Axioms. 2025; 14(8):614. https://doi.org/10.3390/axioms14080614

Chicago/Turabian Style

Zhang, Yang, Shuxia Liu, and Liwei Zeng. 2025. "Full Automorphism Group of (m, 2)-Graph in Finite Classical Polar Spaces" Axioms 14, no. 8: 614. https://doi.org/10.3390/axioms14080614

APA Style

Zhang, Y., Liu, S., & Zeng, L. (2025). Full Automorphism Group of (m, 2)-Graph in Finite Classical Polar Spaces. Axioms, 14(8), 614. https://doi.org/10.3390/axioms14080614

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop