FlashKeepers

Discrete Math · College · College and University

Discrete Math: Graph Theory Basics

Graphs, trees, and basic graph properties and terminology from an intro discrete mathematics course.

About this set

35 basic cards for College Discrete Math. Set 5 of 11 in Discrete Math. It opens with "What is a graph?" and "What is a vertex in a graph?". Study it alongside the other College sets below.

35 cards · basic cards · AI-written, checked twice. Edit anything.

Study this set free Look inside first Get FlashKeepers for iPhone

Opens in your browser, no account. Get the iPhone and iPad app · Android app

What is a graph?
Show answerA mathematical structure consisting of vertices (nodes) and edges (connections) between them.
What is a vertex in a graph?
Show answerA fundamental unit of a graph, also called a node; the point where edges connect.
What is an edge in a graph?
Show answerA connection between two vertices (or a vertex and itself).
Define a directed graph.
Show answerA graph in which each edge has a direction, represented as an arrow pointing from one vertex to another.
Define an undirected graph.
Show answerA graph in which edges have no direction; the connection between two vertices is mutual.
What is a weighted graph?
Show answerA graph in which each edge has an associated numerical value, called its weight.
Define the degree of a vertex.
Show answerThe number of edges incident to (connected to) that vertex.
State the Handshaking Lemma.
Show answerThe sum of the degrees of all vertices equals twice the number of edges.
What is a simple graph?
Show answerAn undirected graph with no loops and no multiple edges between the same pair of vertices.
What is a multigraph?
Show answerA graph in which multiple edges can connect the same pair of vertices.
Define a loop in a graph.
Show answerAn edge that connects a vertex to itself.
What is a connected graph?
Show answerA graph in which there is a path between every pair of vertices.
What is a disconnected graph?
Show answerA graph in which at least one pair of vertices has no path between them.
Define a connected component.
Show answerA maximal connected subgraph of a graph; a subset where every vertex is reachable from every other vertex in that subset.
What is a walk in a graph?
Show answerA sequence of vertices in which each consecutive pair is connected by an edge; vertices and edges may repeat.

20 more cards in the app

Study this set free