A regular graph of girth 6 and valency 11
Let f(11,6) be the number of vertices of an (11,6)-cage. By giving a regular graph of girth 6 and valency 11, we show that f(11,6)≤240. This is the best known upper bound for f(11,6).
Main Author: | P. K. Wong |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
1986-01-01
|
Series: | International Journal of Mathematics and Mathematical Sciences |
Subjects: | |
Online Access: | http://dx.doi.org/10.1155/S0161171286000704 |
Similar Items
-
On certain regular graphs of girth 5
by: M. O'keefe, et al.
Published: (1984-01-01) -
Spectra of Orders for k-Regular Graphs of Girth g
by: Jajcay Robert, et al.
Published: (2021-11-01) -
Generation of strongly regular graphs from quaternary complex Hadamard matrices
by: W. V. Nishadi, et al.
Published: (2018-03-01) -
A note on the problem of finding a (3,9)-cage
by: P. K. Wong
Published: (1985-01-01) -
2-arc transitive polygonal graphs of large girth and valency
by: Swartz, Eric Allen
Published: (2009)