1/7
yr 12 ATAR apps exam S1
Name | Mastery | Learn | Test | Matching | Spaced |
---|
No study sessions yet.
Path
Sequence of edges where neither edges nor vertices are repeated
Trail
Sequence of edges where no edge is repeated
Hamiltonian
CLOSED path (cycle) that includes all vertices. Cannot revisit edges or vertices
Semi-Hamiltonian
OPEN path that includes all vertices. Cannot repeat edges or vertices
Connected graph
A graph in which there is a direct or indirect path between all vertices.
undirected adjacency matrix
An undirected adjacency matrix is symmetric about the diagonal.
Steady state solution condition
If the coefficient/factor is between -1 and 1, the sequence converges to a certain stable value as the position becomes greater. (-1 < a > 1)