Definition
Vertex
Neighbours
Undirected Neighbours
The set of adjacent vertices of a vertex
in an undirected graph is denoted as: The number of neighbours is given by:
Directed Neighbours
The set of successors of a vertex
in a directed graph is given by: The set of predecessors of a vertex
in a directed graph is given by: The number of successors and predecessors is given by:
Degree
Degree
The degree
of a vertex is the number of neighbours of : The minimum degree of a graph
is the smallest degree of any vertex in : The maximum degree of a graph
is the largest degree of any vertex in :
Adjacency Matrix
Definition
Link to originalAdjacency Matrix