Vertex and Edge Graphs
Graphs without any loops or parallel edges.
What are simple graphs?
A type of path that includes every edge in the graph without repetition but does not create a circuit.
What is an Euler path?
Star, Ring, Hybrid
What are network topologies?
The start and ending nodes of a flow network that do not follow the conservation law.
What are the source and sink?
A series of vertices and edges that allow the travel from one vertex to another.
What is a path
A simple graph where each vertex has exactly one edge incident with each pair of vertices.
What is a complete graph?
A type of path that uses every vertex once and only once and does not return to the starting vertex.
What is a Hamilton path?
A sub graph of a graph that eliminates cycles.
What is a Spanning Tree?
The first number in a ratio on edge of a weighted flow network.
What is the flow?
A path that starts and ends with the same vertex.
What is a circuit?
A directional graph made of descendants and ancestors.
What is a rooted tree graph?
A graph will contain an Euler Path if it contains exactly ____ _________ of odd degree.
2 vertices
What is a subtree?
An alternate name for an edge in a flow network.
What is an arc?
An edge that is incident with only one vertex.
What is a loop?
A graph with two distinct vertices sets (V1 and V2).
What is a bipartite graph?
A graph where each vertex has an even degree will contain a(n) ________ ________.
What is an Euler Circuit?
The sum of all edges in a spanning tree.
What is the spanning tree weight?
The process of dividing a source from the sink so to find the maximum flow.
What is the Minimum Cut Algorithm?
Two different edges incident with the same vertices.
What are parallel edges?
An undirected graph in which any two vertices are connected by exactly one path.
What is a tree graph?
A graph with a path that starts and ends at the same vertex and includes all vertices of the graph.
What is Hamiltonian?
An process used for determining a minimum weighted spanning tree by identifying minimum edges.
What is Prim's Algorithm?
The flow capacity of the most restrictive, smallest arc
What is the maximum flow?