# Hamiltonian & Eulerian paths, one vertex graph

Does the graph with only one vertex has an Eulerian path?
And i think he has an Hamiltonian path, right?
Cheers.

-

1
I don't know if everyone defines it the same way, but Diestel's book, at least, allows a path to consist of a single vertex, which means that the answer is yes. – Andrew Uzzell Dec 12 '12 at 14:48
@Andrew: You could post that as an answer so the question doesn't remain unanswered. – joriki Dec 12 '12 at 17:34

## 1 Answer

I'm not sure if all graph theory books treat degenerate cases the same way, but Diestel's Graph Theory, at least, allows a path to have length $0$, i.e., to consist of a single vertex with no edges. If a graph consists of a single vertex $v$, then the a path consisting of $v$ is vacuously Eulerian. It is also a Hamiltonian path, since it contains all of the vertices of the graph.

-
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 3, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.9578784108161926, "perplexity_flag": "head"}