Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:00925981n
Noun Concept
Categories: Graph theory objects
EN
cycle  circuit  closed walk  cycle detection  directed cycle
EN
In graph theory, a cycle in a graph is a non-empty trail in which only the first and last vertices are equal. Wikipedia
English:
graph
graph theory
Definitions
Relations
Sources
EN
In graph theory, a cycle in a graph is a non-empty trail in which only the first and last vertices are equal. Wikipedia
A nontrivial path in a graph from a node to itself Wikipedia Disambiguation
In graph theory, path of edges and vertices wherein a vertex is reachable from itself Wikidata
A closed walk or path, with or without repeated vertices allowed. Wiktionary
Graph theory: closed walk or path. Wiktionary (translation)
IS A
concept
path
PART OF
graph
cycle graph
HAS KIND
loop
Eulerian cycle
Hamiltonian cycle
cycle double cover
chordal graph
DIFFERENT FROM
cyclic process
OPPOSITE OF
tree
Wikipedia
EN
cycle (graph theory)
Wikidata
EN
cycle
Wiktionary
EN
cycle
Wikipedia Redirections
EN
closed walk, Cycle (graph), cycle detection (graph theory), directed cycle, Graph cycle, simple cycle
Wikidata Alias
EN
circuit

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License