Isomorphic (Equivalent) Connected Graphs and Adjacency Matrices (VCE SSCE General Mathematics): Flashcards
📚Flashcards
Practise the cards
10 cards from this deck
ShowHide
Practise the cards
10 cards from this deck
Connected graph
Connected graph
Every vertex can reach every other vertex via edges
Disconnected graph
Disconnected graph
At least one pair of vertices with no connecting path
Bridge in graph theory
Bridge in graph theory
Edge that if removed would disconnect the graph
Effect of removing a bridge
Effect of removing a bridge
Graph becomes disconnected
Isomorphic graphs
Isomorphic graphs
Graphs with same vertices, edges, and connection patterns
Isomorphism requirement (counts)
Isomorphism requirement (counts)
Same number of vertices and same number of edges
Adjacency matrix
Adjacency matrix
Square matrix recording edges between each pair of vertices
Zero in adjacency matrix
Zero in adjacency matrix
No direct edge connects those two vertices
Adjacency matrix symmetry property
Adjacency matrix symmetry property
Symmetric for undirected graphs
Loop location in adjacency matrix
Loop location in adjacency matrix
On the diagonal