Help
Options
Didn't know it?
click below
click below
Knew it?
click below
click below
Don't Know
Remaining cards (0)
Know
retry
shuffle
restart
0:00
Embed Code - If you would like this activity on your web page, copy the script below and paste it into your web page.
Normal Size Small Size show me how
Normal Size Small Size show me how
Lecture 1a Key Terms
Key terms from CSCI 3110 Lecture 1a
| Term | Definition |
|---|---|
| Eulerian Cycle | A cycle of a graph that contains each edge exactly once and ends on the same vertex |
| Eulerian Graph | A graph which contains a Eulerian cycle. |
| Finite Eulerian Graph | A graph which is connected and all vertices' degrees are even |
| Finite Directed Eulerian Graph | When the underlying directed graph is Eulerian, and each in-degree and out-degree are equal |
| In-Degree | The number of head ends coming into a vertex |
| Out-Degree | The number of tail ends coming out of a vertex |
| Eulerian path | A path in a finite graph that visits every edge exactly once, allowing for revisiting vertices |
| Hamiltonian Cycle | A cycle of a graph that visits each vertex exactly once |
| Planar Separator Theorm | A theorem that states that any planar graph can be split into smaller pieces by removing a small number of vertices |
| Edge-Disjoint Cycles | Two cycles are edge-disjoint when they have no edges in common |
Created by:
antonucci
Popular Computers sets