Isomorphic (Equivalent) Connected Graphs and Adjacency Matrices (VCE SSCE General Mathematics): Quizzes
📚Quizzes
Practise the questions
10 questions from this quiz
ShowHide
Practise the questions
10 questions from this quiz
What defines a connected graph?
What defines a connected graph?
Every vertex reaches every other vertex
What is a bridge in a connected graph?
What is a bridge in a connected graph?
Edge that disconnects graph if removed
What must isomorphic graphs have in common?
What must isomorphic graphs have in common?
Same vertices & edges count
Is having same vertex & edge count sufficient for graphs to be isomorphic?
Is having same vertex & edge count sufficient for graphs to be isomorphic?
No, connection pattern must also match
What shape is an adjacency matrix for a graph?
What shape is an adjacency matrix for a graph?
Square matrix
What property do adjacency matrices have for undirected graphs?
What property do adjacency matrices have for undirected graphs?
Symmetric: entry = entry
Where do loops appear in an adjacency matrix?
Where do loops appear in an adjacency matrix?
On the diagonal
What happens to a connected graph when a bridge is removed?
What happens to a connected graph when a bridge is removed?
Graph becomes disconnected
For graphs to be isomorphic, what must be true about vertex degrees?
For graphs to be isomorphic, what must be true about vertex degrees?
Corresponding vertices have same degree
In an adjacency matrix, what does entry value at row , column mean?
In an adjacency matrix, what does entry value at row , column mean?
Two edges connect vertex to