Use LEFT and RIGHT arrow keys to navigate between flashcards;
Use UP and DOWN arrow keys to flip the card;
H to show hint;
A reads text to speech;
10 Cards in this Set
- Front
- Back
|
In a directed graph (digraph), each edge has a specific direction from one vertex to another. |
True |
|
|
A tree is a connected graph without any cycles. |
True |
|
|
A bipartite graph can contain odd-length cycles. |
False |
|
|
In an undirected graph, every vertex must have an even degree for the graph to have Eulerian circuit. |
True |
|
|
A Hamiltonian path is a path in a graph that visits every vertex exactly once and returns to the starting vertex. |
False |
|
|
Graph theory has no practical applications outside of mathematics and computer science. |
False |
|
|
A connected graph with n vertices and n-1 edges is a tree. |
True |
|
|
In a directed graph, the in-degree of a vertex is the number of edges leaving that vertex. |
False |
|
|
A bipartite graph can have a Hamiltonian cycle. |
False |
|
|
The degree of a vertex in a graph is the number of edges incident to that vertex. |
True |
