English

On jumped Wenger graphs

Combinatorics 2017-02-13 v1

Abstract

In this paper we introduce a new infinite class of bipartite graphs, called jumped Wenger graphs, which are closely related to Wenger graphs. An tight upper bound of the diameter and the exact girth of a jumped Wenger graph Jm(q,i,j)J_m(q, i, j ) for integers i,ji, j, 1i<jm+21\leq i <j \leq m+2, are determined. In particular, the exact diameter of the jumped Wenger graph Jm(q,i,j)J_m(q, i, j) if (i,j)=(m,m+2),(m+1,m+2)(i, j)=(m,m+2), (m+1,m+2) or (m,m+1)(m,m+1) is also obtained.

Keywords

Cite

@article{arxiv.1702.03102,
  title  = {On jumped Wenger graphs},
  author = {Li-Ping Wang and Daqing Wan and Weiqiong Wang and Haiyan Zhou},
  journal= {arXiv preprint arXiv:1702.03102},
  year   = {2017}
}
R2 v1 2026-06-22T18:14:40.731Z