On jumped Wenger graphs

DOI10.4208/CMR.2021-0078MaRDI QIDQ6283022arXivFDO

Authors L.-P. Wang, Daqing Wan, Weiqiong Wang, Haiyan Zhou

Publication date 10 February 2017

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12)

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 l e q i < j l e q 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 page was built for publication: On jumped Wenger graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6283022)