|
| |
|
|
A105206
|
|
Number of edges in a pancyclic graph on n+2 vertices with the fewest possible edges.
|
|
1
| |
|
|
3, 5, 6, 8, 9, 10, 12, 13, 14, 15, 16, 17, 19, 20, 21, 22, 23, 24, 25, 26
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 3,1
|
|
|
COMMENTS
| A graph on n vertices is said to be pancyclic if there are cycles of each length 3, 4, ... n in the graph.
|
|
|
EXAMPLE
| For n = 3 the answer is 3; each of the three vertices is connected to each other vertex, forming a 3-cycle. For n = 4 we find it takes five edges and for n = 5 it takes 6.
|
|
|
CROSSREFS
| Different from A080036.
Sequence in context: A094058 A175966 A121882 * A080036 A165290 A026430
Adjacent sequences: A105203 A105204 A105205 * A105207 A105208 A105209
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| John C. George (jgeorge(AT)gdn.edu), Walter D. Wallis (wdwallis(AT)siu.edu) and Alison Marr (marra(AT)southwestern.edu), Apr 12 2005.
|
|
|
EXTENSIONS
| a(14) ... a(22) by Alison Marr, Aug 22 2011.
|
| |
|
|
