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 for integers , , are determined. In particular, the exact diameter of the jumped Wenger graph if or 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}
}