|
Search: id:A079473
|
|
|
| A079473 |
|
Number of prime graphs on n vertices (G is prime iff G has no module. Module are also called homogeneous sets). |
|
+0
1
|
| |
|
|
OFFSET
|
1,5
|
|
|
COMMENT
|
A set of vertices S is called a module if every vertex outside S either sees all vertices in S or none of them. S must be > 1 and < size of the graph.
|
|
EXAMPLE
|
The smallest prime graph and only one on 4 vertices is the 4-path. The 4 graphs on 5 vertices are: P5, C5, House and Bull.
|
|
CROSSREFS
|
Sequence in context: A006056 A098620 A002465 this_sequence A145164 A113078 A156306
Adjacent sequences: A079470 A079471 A079472 this_sequence A079474 A079475 A079476
|
|
KEYWORD
|
more,nonn
|
|
AUTHOR
|
Jim Nastos (nastos(AT)gmail.com), Jan 15 2003
|
|
|
Search completed in 0.002 seconds
|
