graph/network definitions Flashcards
degree
number of edges connected to a vertex
isomorphic
two graphs that have the same vertices and edges
walk
a sequence of edges where the end vertex of one edge is the start vertex of the next
trail
is a walk where none of the vertices are repeated
path
a trail where none of the vertices are repeated
simple graph
when a graph has no loops and there is at most one edge connecting any pair of vertices
connected graph
all the pairs of vertices are connected
tree
a connected graph with no cycles (closed loops)
complete graph
graph where every pair of vertices is connected by a single edge
number of edges with n vertices??
n(n-1)
———
2
planar graph
graph that can be drawn so that none of the arcs cross
bipartite graph
graph where the vertices fall into two sets, in which each edge has a vertex from one set at one end and the other set at the other
undirected graph
a graph that can go in any direction
weighted graph
graph that gives more information than usual
diagraph
graph with a direction given