pith. sign in

arxiv: 1702.03102 · v1 · pith:W422KMT5new · submitted 2017-02-10 · 🧮 math.CO

On jumped Wenger graphs

classification 🧮 math.CO
keywords wengergraphsjumpeddiameterexactgraphbipartitebound
0
0 comments X
read the original 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 $J_m(q, i, j )$ for integers $i, j$, $1\leq i <j \leq m+2$, are determined. In particular, the exact diameter of the jumped Wenger graph $J_m(q, i, j)$ if $(i, j)=(m,m+2), (m+1,m+2)$ or $(m,m+1)$ is also obtained.

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.