[seqfan] Re: Number of Euler graphs: A002854 or something else?
maxale at gmail.com
Tue Feb 9 23:46:07 CET 2010
In Harary and Palmer's "Graphical Enumeration" book:
A002854 are called "even graphs"
A003049 are called "eulerian graphs" (it is said that they are
"connected even graphs").
On Thu, Feb 4, 2010 at 8:15 PM, N. J. A. Sloane <njas at research.att.com> wrote:
> Brendan said:
>> And OEIS should state the definition being used for A002854.
> It does! Look:
> %C A002854 A graph is an Euler graph iff every node has even degree. It need not be connected.
> This definition is the one used in most of the references given in A002854, I believe.
> Certainly Jaap Seidel always used it.
> And it is the definition used by one of the great classic books,
> Seshu and Reed, Linear Graphs and Electrical Networks,
> McGraw-Hill 1961, a book I studied in great detail when it came out!
> Of course definitions can change over time, and in any case
> one should not argue about them too much.
> Seqfan Mailing list - http://list.seqfan.eu/
More information about the SeqFan