Glossary of graph theory: Difference between revisions

Revision as of 23:53, 19 December 2017

Revision as of 21:23, 10 January 2018

Line 348:

{{term|digon}}

{{defn|A [[digon]] is a simple cycle of length two in a directed graph or a multigraph. Digons cannot occur in [[Simple graph|simple]] undirected graphs, as formingthey a closed walk byrequire repeating the same edge twice, doeswhich notviolates producethe adefinition simpleof cycle[[Simple graph|simple]].}}

{{term|digraph}}