Graphs And Networks Flashcards

1
Q

Graph

A

Set of nodes connected by arcs

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

Subgraph

A

Part of a graph

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

Weighted graph

A

A graph with associated edge weights

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

Degree or valency or order

A

Number of edges incident to a vertex

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

Path

A

Finite sequence of connected edges in which no vertex appears more than once

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

Walk

A

Path with duplicate vertices

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

Cycle

A

Closed path, end is start

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

Connected

A

Path between vertices, they are connected

Graph is connected if all vertices are connected

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

Loop

A

Edged that start and finishes at the same vertex

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

Simple graph

A

No loops and only one edge connecting each pair of vertices

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

Digraph

A

Graph with directed edges

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

Tree

A

Connected graph with no cycles

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

Spanning tree

A

A subgraph including all vertices which is a tree

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

Bipartisan graph

A

Two sets of vertices no intralinked

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

Complete graph

A

Every vertex is directly connected by an edge to each of the other vertices

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

Complete bipartisan graph

A

Graph with r vertices in x and s vertices in y

17
Q

Isomorphic graphs

A

Show the same information but are drawn differently

18
Q

Adjacency matrix

A

Number of direct links between vertices

19
Q

Distance matrix

A

Records weights in the edges, no weight = -