GRAPHS AND NETWORKS Flashcards
1
Q
What is a complete graph?
A
An undirected graph where each pair of distinct vertices is paired by a unique edge
2
Q
What does tha n mean in Kn
A
A complete graph with n vertices
3
Q
What is the number of edges for a complete graph Kn?
A
Nc2 or 1/2[n(n-1)]
4
Q
Degree/valency of a vertex
A
Number of edges incident on it
5
Q
Degree of a vertex with a loop (arc coming out of itself then into itself)
A
2
6
Q
Symmetry of distance matrices
A
Symmetrical about leading diagonal - for any undirected graph
6
Q
Rules for digraphs
A
Read along rows not columns🫨
7
Q
A
