<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>04068910</id>
  <dt>j</dt>
  <an>04068910</an>
  <augroup>
    <au>Beenker, G.F.M.</au>
    <au>van Lint, J.H.</au>
  </augroup>
  <ti>Optimal generalized Petersen graphs.</ti>
  <so>Philips J. Res. 43, No.2, 129-136 (1988).</so>
  <py>1988</py>
  <pu>Elsevier Science Publishers, Barking</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
    <ut>generalized Petersen graph</ut>
    <ut>diameter</ut>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
  </ligroup>
  <abgroup>
    <ab>The generalized Petersen graph GPC(n,k) is the graph on 2n vertices, $u\sb j$, $v\sb j$ with edges $(u\sb j,v\sb j)$, $(u\sb j,u\sb{j+1})$, $(v\sb j,v\sb{j+k})$, where $0\le j\le n-1$ and subscripts are taken modulo n. For each value of the diameter the authors determine the GPC with most vertices.</ab>
    <rv>R.C.Read</rv>
  </abgroup>
</item>