Graphs And Networks Flashcards
Graph
Set of nodes connected by arcs
Subgraph
Part of a graph
Weighted graph
A graph with associated edge weights
Degree or valency or order
Number of edges incident to a vertex
Path
Finite sequence of connected edges in which no vertex appears more than once
Walk
Path with duplicate vertices
Cycle
Closed path, end is start
Connected
Path between vertices, they are connected
Graph is connected if all vertices are connected
Loop
Edged that start and finishes at the same vertex
Simple graph
No loops and only one edge connecting each pair of vertices
Digraph
Graph with directed edges
Tree
Connected graph with no cycles
Spanning tree
A subgraph including all vertices which is a tree
Bipartisan graph
Two sets of vertices no intralinked
Complete graph
Every vertex is directly connected by an edge to each of the other vertices