Brainscape's Knowledge GenomeTM

Browse over 1 million classes created by top students, professors, publishers, and experts.


See full index

Discrete Math > Chapter 10.3 Representing Graphs and Graph Isomorphism > Flashcards

Chapter 10.3 Representing Graphs and Graph Isomorphism Flashcards

1
Q

Define Adjacency Lists

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Define Adjacency Matrices

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Adjacency Matrices Example (undirected)

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Adjacency Matrices with loops(undirected) Example

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Adjacency Matrices (directed) def

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Define Incidence Matrices

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Incidence Matrices example

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly

Discrete Math (5 decks)

Brainscape helps you reach your goals faster, through stronger study habits.
© 2024 Bold Learning Solutions. Terms and Conditions