Skip to content
Get Revising
Search:
Keyword:
Go
Subject
Resource type:
Resource type (all)
Flashcards
Revision cards
Revision notes
Quizzes
Mindmaps
Crosswords
Organise your thinking
Quizsearches
Shared resources
Join
Join Get Revising
Start learning now
Already a member?
Please sign in
Email address
Password
Forgotten your password?
Remember my details
Log in
Create
GCSE
A Level & IB
University
Study planner
Past papers
For teachers
More cards in this set
Card 6
Front
The _ (a) of a vertex is the number of edges connected to it
Back
Card 7
Front
The _ (b) of a vertex is the number of edges connected to it
Back
Card 8
Front
The _ (c) of a vertex is the number of edges connected to it
Back
Card 9
Front
A _ graph is a graph with no loops or multiple edges
Back
Card 10
Front
A graph is _ if all its vertices are connected
Back
Card 11
Front
In a _ graph al the vertices are directly connected
Back
Card 12
Front
_ graphs have two sets of vertices
Back
Card 13
Front
_ graphs can be drawn so that no edges cross each other
Back
Card 14
Front
_ graphs are identical graphs (i.e. the vertices and edges are all connected in exactly the same way)
Back
See full card set
