[seqfan] Re: A conjecture concerning connected rooted strength 1 Eulerian graphs with n nodes
nastos at gmail.com
Thu Mar 12 20:28:41 CET 2009
A007126 Number of connected rooted strength 1 Eulerian graphs with n nodes.
I can't find (online) any definition of this 'strength 1' measure of
Eulerian graphs or any kind of graph.
Can someone provide a definition?
On Thu, Mar 12, 2009 at 8:16 AM, Vladeta Jovovic <vladeta at eunet.yu> wrote:
> There is Eric Weisstein's recent seq. A158007: number of simple connected noneulerian graphs on n nodes.
> Clearly A158007(n) = A001349(n) - A003049(n).
> Interestingly, it appears that Euler transform of A158007(n) gives A007126(n+1).
> Can someone clarify that connection?
> Vladeta Jovovic
> Seqfan Mailing list - http://list.seqfan.eu/
More information about the SeqFan