Walk, Any journey through a network starting and ending at any vertex, Path, A journey through a network with no repeated vertices, Cycle, A journey through a network with same start and end and doesn't visit a vertex more than once, Transversable, A network graph that can be traced without lifting pen off the paper., Eulerian Trail, A connected network that uses every edge exactly once and with exactly 2 vertices with odd degree, Eulerian Circuit, A network trail with every vertex of even degree, Hamiltonian Path, A network that travels through every vertex once only, Hamiltonian Cycle, A Hamiltonian Path that starts and finishes at the same vertex

Network Concepts Level 2

by
Print
Embed

Leaderboard

Visual style

Options

Switch template

Continue editing: ?