- 1. Critical Thinking & Problem Solving1h 59m
- 2. Sets4h 25m
- 3. Logic4h 33m
- 4. The Real Number System3h 5m
- 5. Algebra Review8h 46m
- Evaluating Algebraic Expressions15m
- Simplifying Algebraic Expressions1h 2m
- Linear Equations41m
- Direct & Inverse Variation27m
- Linear Inequalities in One Variable41m
- Quadratic Equations59m
- Rectangular Coordinate System28m
- Intro to Functions and Notation29m
- Domain and Range10m
- Using Intercepts to Graph Lines4m
- Slope and Slope-Intercept Form58m
- Systems of Linear Equations1h 25m
- Systems of Linear Inequalities37m
- The Quadratic Formula24m
- 6. Exponential Growth41m
- 7. Personal Finance4h 28m
- 8. Measurement & the Metric System1h 49m
- 9. Geometry3h 37m
- 10. Voting and Apportionment3h 3m
- 11. Graph Theory3h 1m
- 12. Counting & Probability1h 55m
- 13. Introductory Statistics4h 34m
- Introduction to Statistics12m
- Simple Random Sampling10m
- Sampling Methods12m
- Intro to Collecting Data8m
- Types of Data9m
- Bar Graphs22m
- Frequency Distributions and Histograms50m
- Pie Charts (Circle Graphs)14m
- Frequency Polygons10m
- Stemplots14m
- Time Series Graphs9m
- Measures of Central Tendency34m
- Percentiles and Quartiles14m
- Boxplots8m
- Boxplots - Excel8m
- Standard Deviation16m
- Describing Data Numerically Using a Graphing Calculator4m
- Descriptive Statistics - Excel11m
- 14. Predictive Statistics: The Normal Curve and Regression4h 12m
- Intro to Normal Distributions22m
- Interpreting Standard Deviation20m
- Finding Percents of Data for The Normal Distribution1h 3m
- Probabilities & Z-Scores w/ Graphing Calculator19m
- Finding Probabilities, Z Values, and X Values with the Normal Distribution-Excel32m
- Scatterplots & Intro to Correlation26m
- Correlation Coefficient21m
- Creating Scatterplots and Finding Correlation Coefficient - Excel6m
- Linear Regression37m
Intro to Graph Theory: Videos & Practice Problems
Intro to Graph Theory focuses on representing real-world connections with a graph, where vertices stand for objects or locations and edges show the connections between them. A graph can model situations such as land masses connected by bridges or cities connected by train routes, helping you translate written or visual information into a network structure.
Key ideas include deciding whether two vertices are adjacent, which means they share an edge, and finding the order of a graph, which is the number of vertices. You should also be able to count the number of edges and check whether a graph matches a set of stated connections. These skills build a foundation for interpreting, analyzing, and comparing networks by focusing on how vertices and edges are arranged.
Intro to Graph Theory

The graph below represents a map of Konigsberg, where vertices are land masses and edges are the bridges that connect them. Use the graph to answer the questions below.
Find the number of bridges (edges).

6
8
7
9
The graph below represents a map of Konigsberg, where vertices are land masses and edges are the bridges that connect them. Use the graph to answer the questions below.
What is the order of this graph? (order = number of vertices)

5
3
7
4
The graph below represents a map of Konigsberg, where vertices are land masses and edges are the bridges that connect them. Use the graph to answer the questions below.
Are landmasses B & C connected (adjacent)?

Yes
No
Not enough information to tell
The graph below represents a map of Konigsberg, where vertices are land masses and edges are the bridges that connect them. Use the graph to answer the questions below.
Are landmasses A & D connected (adjacent)?

Yes
No
Not enough information to tell
Intro to Graph Theory Example 1
Intro to Graph Theory Example 2
Drawing Graphs to Model Situations
Drawing Graphs to Model Situations Example 3
Drawing Graphs to Model Situations Example 4
Drawing Graphs to Model Situations Example 5
Drawing Graphs to Model Situations Example 6
Select the graph that represents the following train routes between major European cities.
▸ Barcelona has trains that go to Paris and Milan.
▸ Paris has trains that go to Barcelona, Milan, and Amsterdam.
▸ Amsterdam has trains that go to Paris, Milan, and Berlin.
▸ Milan has trains that go to Barcelona, Paris, Amsterdam, Rome, and Vienna.
▸ Rome has a train that goes to Milan.
▸ Berlin has trains that go to Amsterdam and Vienna.
▸ Vienna has trains that go to Milan and Berlin
Here's what students ask on this topic:
In graph theory, a graph is a mathematical structure used to model pairwise relations between objects. It consists of vertices (also called nodes) and edges. Vertices represent objects or locations, while edges represent the connections or relationships between these vertices. For example, a graph can model cities as vertices and train routes as edges connecting them. This representation helps translate complex real-world networks into a visual and analytical form, making it easier to study connectivity, paths, and relationships within the system.
Two vertices in a graph are considered adjacent if there is an edge directly connecting them. In other words, adjacency means that the two vertices share a common edge. This concept is fundamental in graph theory because it helps identify immediate connections between objects or locations represented by the vertices. For example, in a graph representing cities and roads, two cities are adjacent if there is a direct road between them.
The order of a graph is the number of vertices it contains. It is an important characteristic because it gives a basic measure of the graph's size. Knowing the order helps in understanding the scale of the network and is essential for analyzing properties such as connectivity, complexity, and potential paths within the graph. For instance, a graph with 10 vertices has an order of 10.
To count the number of edges in a graph, you simply count all the connections between vertices. Each edge represents a link between two vertices. In an undirected graph, each edge is counted once, while in a directed graph, edges have direction and are counted based on their direction. Counting edges helps analyze the density and connectivity of the graph, which are important for understanding the network's structure and behavior.
To verify if a graph matches a given set of connections, you compare the edges in the graph with the specified connections. Each connection should correspond to an edge between the correct pair of vertices. If all connections are represented accurately by edges and no extra edges exist, the graph matches the set. This process ensures the graph correctly models the intended network and is crucial for accurate analysis and interpretation.