What is a graph in graph theory?
A graph is written as , where contains vertices and contains edges joining pairs of vertices.
Study 09 Introduction to Graph Theory with 12 free online flashcards. Review key terms, definitions, and concepts with this interactive flashcard deck.
What is a graph in graph theory?
A graph is written as G=(V,E), where V contains vertices and E contains edges joining pairs of vertices.
What does the order of a graph measure?
The order of a graph is ∣V∣, the number of vertices.
What does the size of a graph measure?
The size of a graph is ∣E∣, the number of edges.
Which representation lists each vertex’s neighbors?
An adjacency list records the neighbors of each vertex and is usually efficient for sparse graphs.
What special property does an undirected graph’s adjacency matrix have?
For an undirected graph, the adjacency matrix is symmetric because adjacency from one vertex to another is mutual.
What is the degree of a vertex?
The degree deg(v) is the number of edges incident with vertex v. A loop contributes 2.
State the Handshaking Lemma.
The Handshaking Lemma states ∑v∈Vdeg(v)=2∣E∣ for every finite undirected graph.
What is a walk?
A walk is a vertex sequence in which consecutive vertices are adjacent; vertices and edges may repeat.
What distinguishes a trail from a walk?
A trail is a walk that does not repeat edges; vertices may still repeat.
What is a path?
A path is a walk that does not repeat vertices.
What is a cycle?
A cycle is a closed path that begins and ends at the same vertex, with no other vertex repeated.
When is a graph connected?
A graph is connected when every pair of vertices has a path between them.
A progressive guide to interpreting, calculating, and applying limits, asymptotes, continuity, and the Intermediate Value Theorem.
A progressive guide to solving linear equations, rearranging formulas, using proportions and percents, and modeling everyday applications with equations.
A progressive guide to converting, graphing, differentiating, and integrating polar curves, with emphasis on symmetry, intersections, area, and arc length.
A medium-difficulty quiz on double and triple integrals, including regions of integration, applications, density, average value, moments, and integral setup.
A 14-question quiz on sequences, sequence limits, monotonicity, boundedness, convergence criteria, the Squeeze Theorem, limit laws, and recursive sequences. Questions progress from foundational understanding to applied reasoning.
A structured guide to defining sequences, evaluating their limits, and proving convergence or divergence using limit laws, bounds, monotonicity, the Squeeze Theorem, and recursive methods.
A structured guide to vector spaces, subspaces, spans, independence, bases, dimension, and coordinates, with definitions, tests, examples, and a unified problem-solving workflow.
A progressive guide to identifying eigenvalues and eigenvectors, computing eigenspaces, comparing algebraic and geometric multiplicities, and determining when a matrix can be diagonalized.
A 14-question assessment on power series, convergence, term-by-term operations, Taylor and Maclaurin series, polynomial approximation, and error bounds. The questions progress from foundational interpretation to applied convergence and approximation problems.
A progressive guide to representing functions with power and Taylor series, determining convergence, manipulating series, and controlling approximation error.
A structured guide to simplifying rational expressions, solving rational equations, analyzing rational functions, graphing their key features, and applying them to rates, work, and cost models.
A connected guide to modeling geometry, motion, mass, fields, work, flux, and optimization with the main tools of multivariable calculus.