On jumped Wenger graphs
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 ) for integers i, j, 1≤ i <j ≤ m+2, are determined. In particular, the exact diameter of the jumped Wenger graph Jm(q, i, j) if (i, j)=(m,m+2), (m+1,m+2) or (m,m+1) is also obtained.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.