Definitions Flashcards
(34 cards)
1
Q
Define Graph
A
2
Q
Define Loop/Multiple Edges
A
3
Q
Define Simple Graph
A
4
Q
Define Adjacent/Incident
A
5
Q
Define Neighbourhood/Degree
A
6
Q
Define Isolated Vertex/Pendant
A
7
Q
Define Adjacency Table
A
8
Q
Define Adjacency Matrix
A
9
Q
Define Isomorphic Graphs
A
10
Q
Define Unlabelled Graph
A
11
Q
Define Subgraph
A
12
Q
Define Graph Operations
A
13
Q
Define Different Subgraphs
A
14
Q
Define Paths (Graph)
A
15
Q
Define Cycles
A
16
Q
Define Complete Graph
A
17
Q
Define Empty Graph
A
18
Q
Define Bipartite
A
19
Q
Define Degree Sequence
A
20
Q
Define d-regular
A
21
Q
Define Walk/Path
A
22
Q
Define Closed Walk/Cycle
A
23
Q
Define Length of Path
A
24
Q
Define Connected/Connected Components
A
25
Define Trail/Eulerian/Semi-Eulerian
26
Define Hamiltonian/Semi-Hamiltonian
27
Define Acyclic/Forest/Tree/Leaf
28
Define Cut-Edge
29
Define Spanning Tree
30
Define The Prufer Code
31
Define Matching/Perfect
32
Define Maximal/Maximum Matching
33
Define Alternating Path
34
Define Matches/Neighbourhood of S
