cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A107456 Number of nonisomorphic generalized Petersen graphs P(n,k) with girth 7 on n vertices for 1<=k<=Floor[(n-1)/2].

Original entry on oeis.org

1, 1, 1, 1, 2, 1, 2, 1, 3, 2, 2, 0, 2, 2, 2, 4, 2, 1, 2, 2, 2, 2, 5, 1, 2, 2, 2, 2, 2, 4, 2, 2, 2, 2, 2, 1, 5, 2, 2, 2, 2, 1, 2, 5, 2, 2, 2, 1, 2, 2, 5, 2, 2, 1, 2, 2, 2, 5, 2, 1, 2, 2, 2, 2, 5, 1, 2, 2, 2, 2, 2, 4, 2, 2, 2, 2, 2, 1, 5, 2, 2, 2, 2, 1, 2, 5, 2, 2
Offset: 13

Views

Author

Marko Boben (Marko.Boben(AT)fmf.uni-lj.si), Tomaz Pisanski and Arjana Zitnik (Arjana.Zitnik(AT)fmf.uni-lj.si), May 26 2005

Keywords

Comments

The generalized Petersen graph P(n,k) is a graph with vertex set V(P(n,k)) = {u_0,u_1,...,u_{n-1},v_0,v_1,...,v_{n-1}} and edge set E(P(n,k)) = {u_i u_{i+1}, u_i v_i, v_i v_{i+k} : i=0,...,n-1}, where the subscripts are to be read modulo n.

Examples

			A generalized Petersen graph P(n,k) has girth 7 if and only if it has girth more than 6 and (n=7k or 2n=7*k or 3n=7k or k=4 or 4k=n+1 or 4=n-k or 4k=n-1 or 4k=2n-1 or 3k=n+2 or 3=n-2k or 3k=n-2)
The smallest generalized Petersen graph with girth 7 is P(13,5)
		

References

  • I. Z. Bouwer, W. W. Chernoff, B. Monson and Z. Star, The Foster Census (Charles Babbage Research Centre, 1988), ISBN 0-919611-19-2.

Crossrefs