What does an Eulerian path use exactly once?
An Eulerian path uses every edge exactly once. An Eulerian circuit is an Eulerian path that begins and ends at the same vertex.
Study 11 Graph Properties and Applications with 12 free online flashcards. Review key terms, definitions, and concepts with this interactive flashcard deck.
What does an Eulerian path use exactly once?
An Eulerian path uses every edge exactly once. An Eulerian circuit is an Eulerian path that begins and ends at the same vertex.
When does a connected graph have an Eulerian circuit?
A connected undirected graph has an Eulerian circuit if and only if every vertex has even degree.
What degree pattern gives an open Eulerian path?
A connected undirected graph has an Eulerian path but no circuit exactly when two vertices have odd degree; the path starts and ends at those vertices.
What is a Hamiltonian path?
A Hamiltonian path visits every vertex exactly once. Unlike an Eulerian path, it is concerned with vertices rather than edges.
What degree condition is necessary for a Hamiltonian cycle?
Every vertex in a Hamiltonian cycle must have degree at least 2, because the cycle enters and leaves each vertex.
What graph structure represents a feasible TSP tour?
A feasible TSP tour is a Hamiltonian cycle, and the objective is to minimize its total edge weight.
What is Euler’s formula for a connected plane graph?
For a connected plane graph, Euler’s formula is ∣V∣−∣E∣+∣F∣=2, where ∣F∣ includes the unbounded exterior face.
What makes a graph planar?
A planar graph can be drawn in the plane with no edge crossings except at shared endpoints. The property belongs to the abstract graph, not one particular drawing.
Which two graphs characterize nonplanarity in Kuratowski’s theorem?
Kuratowski’s theorem states that a graph is planar exactly when it contains no subdivision of K5 or K3,3.
What is the chromatic number?
A proper vertex coloring assigns different colors to adjacent vertices. The chromatic number χ(G) is the minimum number of colors needed.
How does vertex coloring model exam scheduling?
In exam scheduling, exams are vertices and edges connect exams sharing students. A proper coloring assigns time slots so adjacent exams do not occur simultaneously.
How do maximal, maximum, and perfect matchings differ?
A matching is maximal if no edge can be added, maximum if it has the greatest possible size, and perfect if every vertex belongs to exactly one selected edge.
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.