Repository logo
 

On Some Cycles in Wenger Graphs

Accepted version
Peer-reviewed

Type

Article

Change log

Authors

Wang, Ye 
Lazebnik, Felix 
Thomason, Andrew 

Abstract

Let p be a prime, q be a power of p, and let F q be the field of q elements. For any positive integer n, the Wenger graph W n (q) is defined as follows: it is a bipartite graph with the vertex partitions being two copies of the (n + 1)-dimensional vector space F n+1 , and two vertices p = (p(1), . . . , p(n + 1)), and l = [l(1), . . . , l(n + 1)] q being adjacent if p(i) + l(i) = p(1)l(1) i−1 , for all i = 2, 3, . . . , n + 1.

Description

Keywords

cycle, pancyclic, finite field, Wenger graph, graph embeddings

Journal Title

ACTA MATHEMATICAE APPLICATAE SINICA-ENGLISH SERIES

Conference Name

Journal ISSN

0168-9673
1618-3932

Volume Title

36

Publisher

Springer Science and Business Media LLC

Rights

All rights reserved