One
a point on a network graph
what is a vertex?
The name of the area enclosed by edge or edges.
What is a face
An application of a weighted graph.
What is determine the shortest distance.
the matrix form of a network graph
What is an adjacency matrix?
Graph that can be redrawn to show no edges crossover
What is a planar graph
line joining two vertices
what is an edge?
a vertex not connected to any others
What is an isolated vertex?
a a smaller selection of a larger network graph
What is a sub graph?
the name given to graphs that are identical in the number of vertices and number of edges and the same connections between vertices
What are isomorphic graphs?
This graph shows the vertices with the directed edges
What is a directed graph?
what is the degree?
A walk with no repeated vertices or edges.
What is a Path
A path that starts and ends at the same vertex, which must visit every vertex exactly once.
What is a Hamilton Path
The name given when a graph is re-drawn so that no edges intersect each other
What is a planar graph?
One whose vertices may be split into two distinct groups
what is a bipartite graph
A walk with no repeated edges
a network graph with no multiple edges or loops
What is a simple graph?
a simple graph that has every vertex connected to every other vertex
What is a complete graph?
what is euler's formula?
v+f-e=2
The graph in which the number of degree from each vertex is same one less from the number of vertices
What is a complete graph?
The name given when a vertex is connected to itself
What is a loop?
A network graph which is part of another graph
What is a subgraph?
A Closed trail that includes every edge exactly once
What is an Eulerian Trail
the name given to an edge that when removed from a connected graph leaves the graph disconnected
what is a bridge?
a walk that starts and ends at the same vertex and edges that are not repeated and vertices that are not repeated
what is a cycle?