|
Search: id:A129581
|
|
|
| A129581 |
|
Number of labeled prime graphs with respect to the Cartesian multiplication of graphs. |
|
+0
1
|
|
| 1, 1, 4, 35, 728, 26464, 1866256, 251518352, 66296210432, 34496477587456, 35641657548953344, 73354596197458024448, 301272202649664088951808, 2471648811030427594714599424, 40527680937730480229320939012096
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
REFERENCES
|
Ji Li, Exponential Composition of Species and Prime Graphs, prepring, arXiv:0705.0038, 2007.
|
|
LINKS
|
Ji Li, Exponential Composition of Species and Prime Graphs
|
|
FORMULA
|
Let D(P) be the exponential Dirichlet generating series for the species of prime graphs and let D(C) be the exponential Dirichlet generating series for the species of connected graphs. We have D(P)=log D(C)
|
|
EXAMPLE
|
Almost all connected graphs are prime graphs with respect to Cartesian product of graphs. So instead of giving an example of prime graph, we give here an example of a connected nonprime graph on vertices {1,2,3,4}:
1 --- 4
| ... |
2 --- 3
The above graph is not prime since it is the Cartesian product of two line graphs of order 2.
|
|
CROSSREFS
|
Cf. This is the logarithmic of A001187. Unlabeled prime graphs is given by A129582.
Sequence in context: A005973 A007134 A125798 this_sequence A120055 A076818 A005026
Adjacent sequences: A129578 A129579 A129580 this_sequence A129582 A129583 A129584
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Ji Li (vieplivee(AT)hotmail.com), May 04 2007
|
|
|
Search completed in 0.002 seconds
|
