4268622
Beschreibung
Quiz von Will Rickard, aktualisiert more than 1 year ago
|
Erstellt von Will Rickard
vor mehr als 8 Jahre
|
|
Frage 1
Frage
What is the formal name for the points on a graph?
Antworten
-
Vertices
-
Edges
Frage 2
Frage
What is the formal name for the lines connecting the points on a graph?
Antworten
-
Vertices
-
Edges
Frage 3
Frage
V = [blank_start]{a,b,c,d,e}[blank_end]
Antworten
-
{a,b,c,d,e}
Frage 4
Frage
E = [blank_start]{{a, b}, {b, c}, {a, c}, {c, d}}[blank_end]
Antworten
-
{{a, b}, {b, c}, {a, c}, {c, d}}
Frage 5
Frage
Two graphs are equal if and only if they have the same vertices and the same edges.
Antworten
- True
- False
Frage 6
Frage
Two graphs are equal if and only if they have some vertices and the same edges.
Antworten
- True
- False
Frage 7
Frage
We say that two graphs G and H are [blank_start]isomorphic[blank_end] if we can relabel the vertices of G to obtain H.
Antworten
-
isomorphic
Frage 8
Frage
The [blank_start]order[blank_end] of a graph G is the number of vertices of G
Antworten
-
order
Frage 9
Frage
The order of a graph G is the number of [blank_start]vertices[blank_end] of G
Antworten
-
vertices
Frage 10
Frage
The [blank_start]size[blank_end] of G is the number of edges of G
Antworten
-
size
Frage 11
Frage
The size of G is the number of [blank_start]edges[blank_end] of G
Antworten
-
edges
Frage 12
Frage
We often write [blank_start]uv[blank_end] as shorthand for an edge {u,v}
Antworten
-
uv
-
{uv}
Frage 13
Frage
We often write uv as shorthand for an edge {[blank_start]u, v[blank_end]}
Antworten
-
u,v
Frage 14
Frage
We say that an edge e = uv is [blank_start]incident[blank_end] to the vertices u and v.
Antworten
-
incident
-
adjacent
Frage 15
Frage
If uv is an edge, we say that the vertices u and v are [blank_start]adjacent[blank_end]
Antworten
-
adjacent
-
incident
Frage 16
Frage
u is a [blank_start]neighbour[blank_end] of v and that v is a neighbour of u.
Antworten
-
neighbour
Frage 17
Frage
For any vertex v of a graph G, the [blank_start]neighbourhood[blank_end] N(v) of v is the set of neighbours of v
Antworten
-
neighbourhood
Frage 18
Frage
For any vertex v of a graph G, the ............. of v is the set of neighbours of v
Antworten
-
neighbourhood N(v)
-
neighbourhood N(u)
-
compliment N(v)
-
neighbourhood G(v)
-
neighbourhood d(v)
-
neighbourhood N(G)
Frage 19
Frage
We say that v is isolated if it has no [blank_start]neighbours[blank_end].
Antworten
-
neighbours
Frage 20
Frage
We say that v is [blank_start]isolated[blank_end] if it has no neighbours.
Antworten
-
isolated
-
complementary
-
distinct
-
incident
-
adjacent
Frage 21
Frage
The neighbourhood of a is N(a) = [blank_start]{b, c}[blank_end]
Antworten
-
{b, c}
Frage 22
Frage
The neighbourhood of d is N (d) = [blank_start]{c}[blank_end]
Antworten
-
{c}
Frage 23
Frage
The neighbourhood of e is N(e) = [blank_start]empty[blank_end]
Antworten
-
empty
Frage 24
Antworten
-
an isolated
-
an adjacent
-
a
Frage 25
Frage
Vertex e is an [blank_start]isolated[blank_end] vertex
Antworten
-
isolated
Frage 26
Frage
The degree of a vertex v in a graph G is d(v) = |N(v)|, that is,
Antworten
-
The number of neighbours of v
-
The number of edges of v
-
The number of vertices of v
-
The number of v
Frage 27
Frage
d(v) =
Antworten
-
|N(v)|
-
|G(v)|
-
0
Frage 28
Frage
The vertex degrees are
d(a) = [blank_start]2[blank_end],
d(b) = [blank_start]2[blank_end],
d(c) = [blank_start]3[blank_end],
d(d) = [blank_start]1[blank_end]
d(e) = [blank_start]0[blank_end].
Antworten
-
2
-
2
-
3
-
1
-
0
Frage 29
Frage
If G is a graph with n vertices, then the degree of each vertex of G is an integer between 0 and n − 1.
Antworten
- True
- False
Frage 30
Frage
If G is a graph with n vertices, then the degree of each vertex of G is an integer between [blank_start]0[blank_end] and [blank_start]n − 1[blank_end].
Antworten
-
0
-
n − 1
Frage 31
Frage
If G is a graph with n vertices, then the [blank_start]degree[blank_end] of each vertex of G is an integer between 0 and n − 1.
Antworten
-
degree
Frage 32
Frage
The sum of all vertex degrees is twice the number of edges
Antworten
- True
- False
Frage 33
Frage
the sum of all vertex degrees is [blank_start]twice[blank_end] the number of edges
Antworten
-
twice
Frage 34
Frage
The sum of all vertex degrees is twice the number of [blank_start]edges[blank_end]
Antworten
-
edges
Frage 35
Frage
The sum of all vertex [blank_start]degrees[blank_end] is twice the number of edges
Antworten
-
degrees
Frage 36
Frage
In any graph there are an even number of vertices with odd degree.
Antworten
- True
- False
Frage 37
Frage
In any graph there are an even number of edges with odd degree.
Antworten
- True
- False
Frage 38
Frage
Any graph on at least two vertices has two vertices of the same [blank_start]degree[blank_end].
Antworten
-
degree
Frage 39
Frage
The [blank_start]degree sequence[blank_end] of a graph G is the sequence of all degrees of vertices in G
Antworten
-
degree sequence
Frage 40
Frage
The [blank_start]minimum degree[blank_end] of a graph G, denoted δ(G), is the [blank_start]smallest[blank_end] degree of a vertex of G.
Antworten
-
minimum degree
-
smallest
Frage 41
Frage
The [blank_start]maximum degree[blank_end] of a graph G, denoted ∆(G), is the [blank_start]largest degree[blank_end] of a vertex of G.
Antworten
-
maximum degree
-
largest degree
Frage 42
Frage
A graph G is [blank_start]regular[blank_end] if every vertex of G has the same degree
Antworten
-
regular
Frage 43
Frage
We say that G is k-regular to mean that every vertex has degree k.
Antworten
- True
- False
Frage 44
Frage
We say that G is [blank_start]k[blank_end]-regular to mean that every vertex has degree k.
Antworten
-
k
Frage 45
Frage
We say that G is [blank_start]k-regular[blank_end] to mean that every vertex has degree k.
Antworten
-
k-regular
Frage 46
Frage
A graph H is a [blank_start]subgraph[blank_end] of a graph G if we can obtain H by deleting vertices and edges of G.
Antworten
-
subgraph
Frage 47
Frage
A graph H is a subgraph of a graph G if we can obtain H by [blank_start]deleting[blank_end] vertices and edges of G
Antworten
-
deleting
Frage 48
Frage
H is a [blank_start]spanning[blank_end] subgraph of G if additionally V (H) = V (G), that is, if only edges were deleted.
Antworten
-
spanning
-
"blank"
-
copy
Frage 49
Frage
H is a [blank_start]subgraph[blank_end] of a graph G if we can obtain H by deleting vertices and edges of G.
Antworten
-
subgraph
-
graph
-
spanning subgraph
-
copy
Frage 50
Frage
Let G be a graph with δ(G) ≥ 2. Then G contains a cycle.
Antworten
- True
- False
Frage 51
Frage
Let G be a graph with δ(G) ≥ 0. Then G contains a cycle.
Antworten
- True
- False
Frage 52
Frage
Let G be a graph with N(G) ≥ 2. Then G contains a cycle.
Antworten
- True
- False
Frage 53
Frage
Any graph with n vertices and at least n edges contains a cycle
Antworten
- True
- False
Frage 54
Frage
Any graph with n vertices and at least n-1 edges contains a cycle
Antworten
- True
- False
Frage 55
Frage
Any graph with n+1 vertices and at least n edges contains a cycle
Antworten
- True
- False
Frage 56
Frage
The length of W is the number of [blank_start]edges[blank_end] traversed
Antworten
-
edges
-
vertices
Frage 57
Frage
A walk is closed if the first and last vertices of the walk are the same, that is, if you finish at the same vertex at which you started.
Antworten
- True
- False
Frage 58
Frage
A walk is open if the first and last vertices of the walk are the same, that is, if you finish at the same vertex at which you started.
Antworten
- True
- False
Frage 59
Frage
A walk is a path if and only if it has no repeated vertices
Antworten
- True
- False
Frage 60
Frage
walk is a path if and only if it has repeated vertices
Antworten
- True
- False
Frage 61
Frage
A closed walk is a cycle if and only if the only repeated vertex is the first and last vertex
Antworten
- True
- False
Frage 62
Frage
A closed walk is a cycle if and only if there is a repeated vertex at the first and last vertex
Antworten
- True
- False
Frage 63
Frage
A graph G is [blank_start]connected[blank_end] if for any two vertices u and v of G there is a walk in G from u to v.
Antworten
-
connected
Frage 64
Frage
A [blank_start]connected component[blank_end] of G is a maximal connected subgraph of G
Antworten
-
connected component
-
component
-
subgraph
-
tree
-
cycle
Frage 65
Frage
A tree is a [blank_start]connected[blank_end] [blank_start]acyclic[blank_end] graph.
Antworten
-
connected
-
component
-
walk
-
path
-
unconnected
-
join
-
acyclic
-
walks
-
paths
-
cyclic
Frage 66
Frage
A [blank_start]leaf[blank_end] of a tree is a vertex v with d(v) = [blank_start]1[blank_end].
Antworten
-
leaf
-
edge
-
vertex
-
1
-
2
-
0
-
5
Frage 67
Frage
Any tree on n ≥ 2 vertices has a leaf.
Antworten
- True
- False
Frage 68
Frage
Any tree on n ≥ 0 vertices has a leaf.
Antworten
- True
- False
Frage 69
Frage
Any connected graph contains a spanning tree
Antworten
- True
- False
Frage 70
Frage
Any connected graph on n vertices with precisely n − 1 edges is a tree
Antworten
- True
- False
Frage 71
Frage
Any connected graph on n vertices with precisely n edges is a tree
Antworten
- True
- False
Frage 72
Frage
Any acyclic graph on n vertices with precisely n − 1 edges is a tree.
Antworten
- True
- False
Frage 73
Frage
Any acyclic graph on n vertices with precisely n edges is a tree.
Antworten
- True
- False
Möchten Sie mit GoConqr kostenlos Ihre eigenen Quiz erstellen? eigenen Mehr erfahren.