TOPICS
Search

Noneulerian Graph


A noneulerian graph is a graph that is not Eulerian. The numbers of simple noneulerian graphs on n=1, 2, ... nodes are 2, 3, 10, 30, 148, 1007, 12162, 272886, ... (OEIS A145269), and the corresponding numbers of simple connected noneulerian graphs are 0, 1, 1, 5, 17, 104, 816, 10933, 259298, ... (OEIS A158007).

Any graph with a vertex of odd degree or a bridge is noneulerian.


See also

Eulerian Graph

Explore with Wolfram|Alpha

References

Sloane, N. J. A. Sequences A145269 and A158007 in "The On-Line Encyclopedia of Integer Sequences."

Referenced on Wolfram|Alpha

Noneulerian Graph

Cite this as:

Weisstein, Eric W. "Noneulerian Graph." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/NoneulerianGraph.html

Subject classifications