Movatterモバイル変換


[0]ホーム

URL:


TOPICS
SearchClose
Search

Noneulerian Graph


DOWNLOAD Mathematica NotebookDownloadWolfram Notebook

A noneulerian graph is a graph that is notEulerian. The numbers of simple noneulerian graphs onn=1, 2, ... nodes are 2, 3, 10, 30, 148, 1007, 12162, 272886, ... (OEISA145269), and the corresponding numbers of simple connected noneulerian graphs are 0, 1, 1, 5, 17, 104, 816, 10933, 259298, ... (OEISA158007).

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. SequencesA145269 andA158007 in "The On-Line Encyclopedia of Integer Sequences."

Referenced on Wolfram|Alpha

Noneulerian Graph

Cite this as:

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

Subject classifications

Created, developed and nurtured by Eric Weisstein at Wolfram Research

[8]ページ先頭

©2009-2025 Movatter.jp