Discrete Math for Computer Science, unit: Graph Theory. Core concepts, terminology, and worked-example cues a college student meets for this unit, building on prior units without repeating them. Front: a term, concept, or short problem cue. Back: the definition, explanation, or answer.
About this set
38 basic cards for College Computer Science. Set 5 of 8 in Discrete Math for Computer Science. It opens with "What is a graph, in discrete mathematics?" and "What is a vertex, in graph theory?". Study it alongside the other College sets below.
38 cards · basic cards · AI-written, checked twice. Edit anything.
- What is a graph, in discrete mathematics?
Show answer
A structure consisting of vertices (nodes) connected by edges- What is a vertex, in graph theory?
Show answer
A fundamental unit (node or point) of a graph- What is an edge, in graph theory?
Show answer
A connection between two vertices in a graph- What is a directed graph?
Show answer
A graph where edges have a specific direction from one vertex to another- What is an undirected graph?
Show answer
A graph where edges have no direction, representing a mutual connection- What is the degree of a vertex?
Show answer
The number of edges connected to that vertex- What is a path, in graph theory?
Show answer
A sequence of edges connecting a sequence of distinct vertices- What is a cycle, in graph theory?
Show answer
A path that starts and ends at the same vertex without repeating other vertices- What is a connected graph?
Show answer
A graph where there is a path between every pair of vertices- What is a weighted graph?
Show answer
A graph where each edge has an associated numerical value, often representing cost or distance- What is a tree, in graph theory?
Show answer
A connected, acyclic graph- What is a bipartite graph?
Show answer
A graph whose vertices can be divided into two sets with edges only between the sets, never within- What is a complete graph?
Show answer
A graph where every pair of vertices is connected by an edge- What is graph coloring?
Show answer
Assigning labels (colors) to vertices so no two adjacent vertices share the same color- What is an adjacency matrix?
Show answer
A matrix representation of a graph showing which vertex pairs are connected
FlashKeepers