Flashcards in Graphs and Networks Terminology Deck (17):
A part of the original graph.
he number of arcs incident to a vertex/node.
A finite sequence of edges such that the end vertex of one edge is the start of the next. No vertex appears more than once.
A path which you are permitted to return to vertices more than once.
A closed path where the end vertex of the last edge is the start vertex of the first edge.
A graph where all vertices are connected.
Has no loop and has no more than one edge connecting each pair of vertices.
Starts and finishes at the same vertex.
The edges have a direction associated to it.
Records the number of direct links between vertices.
Records the weights on the edges. Where there is no edge, we write "-".
A connected graph with no cycles.
A spanning tree
A subgraph that is a tree and includes all vertices.
Two sets of verticies, X and Y. The edges only join vertices in X to vertices in Y, not to any vertices within another set.
Every vertex is directly connected by an edge to each of the other vertices. Denoted by K_n.
Complete bipartite graph
Denoted by K_(r,s) where there are "r" vertices in set X and "s" vertices in set Y.