Scribd
Upload
120 views

Discrete Mathematics Graph Worksheet

The document contains several examples of graphs defined by their vertices (V) and edges (E). For each graph, it evaluates statements about the graph's properties, such as whether it is connected, contains cycles, or can form an Eulerian or Hamiltonian cycle. The examples explore different graph structures and connectivity to illustrate concepts from discrete mathematics.

Uploaded by

lucas97jensen
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
120 views

Discrete Mathematics Graph Worksheet

The document contains several examples of graphs defined by their vertices (V) and edges (E). For each graph, it evaluates statements about the graph's properties, such as whether it is connected, contains cycles, or can form an Eulerian or Hamiltonian cycle. The examples explore different graph structures and connectivity to illustrate concepts from discrete mathematics.

Uploaded by

lucas97jensen
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

Discrete Mathematics:

Hand-in 7

V = {a,b,c,d,e}
E = {{a,b}, {a,d}, {b,d}, {b,c}, {c,d}, {c,e}, {e,d}}

1. Yes, because there is no vortex left without an edge to another vortex.


2. No, because there are multiple cyclic connections.
3. Yes, because there are two vertices with an odd number of edges.
4. Yes - {a,b,c,d,e,a}
V = {a,b,c,d,e,f}
E = {{e,d}, {e,b}, {b,c}, {e,c}, {e,a}}

1. No, vortex f is disconnected due to there being no edge between it and the others.
2. No, the cycle between c,b and e disproves this.
3. Yes, by the following order {{d,e}, {e,b}, {b,c}, {c,e}, {e,a}}.
4. No, the disconnection of f breaks this.

V = {a,b,c}
E = {{a,a}, {a,b}, {b,c}, {c,b}}

1. Yes, there is no vortex left out.


2. No, {{b,c}, {c,b}} disproves this.
3. Yes, by the following order {{a,a}, {a,b}, {b,c}, {c,b}}
4. Yes, {{a,b}, {b,c}}
V = {a,b,c,d}
E = {{a,b}, {b,a}, {a,c}, {c,d}, {d,a}}

1. Yes, all vertices are connected with at least one edge.


2. No, {{a,b}, {b,c}} disproves this.
3. Yes by the following order {{a,b}, {b,a}, {a,c}, {c,d}, {d,a}}
4. No, “a” makes it impossible, since it will always require two visits to make a full cycle.

V = {a,b,c,d,e}
E = {{a,b}, {b,c}, {a,d}, {d,e}}

1. Yes, all vertices are connected with at least one edge.


2. Yes, there exists no cycles in this graph
3. No, because they’re directed and only one path is available
4. No, same as the eulerian
We have n vertices and n edges. No nodes are disconnecting, and the graph loops back on
itself, due to there being no vertices of degree 0 or 1.

The handshaking lemma states that in a graph, the sum of each vertex’s degree is equal to the
number of edges times 2.

∑(𝑑𝑒𝑔) = 2 · 𝑛 ⇔ 𝑛 · 𝑑𝑒𝑔 = 2 · 𝑛 (note that number of vertices and edges both equal n)
𝑛

𝑑𝑒𝑔 = 2(algebra)

Therefore, every vertex of G has degree 2.

Proof: Assume 𝐺1 is a connected graph. This means that for any two vertices a and b, there will
be a traversable path between them. Because 𝐺1 and 𝐺2 are isomorphic, any given vertex will
have an equivalent vertex in 𝐺2. That is, a bijection such that f(𝑎1)→𝑎2, f(𝑏1)→𝑏2 and a and b are
joined by an edge if and only if f(a) and f(b) are joined by an edge, will exist.
This means that any connected pair of vertices in 𝐺1can be found in 𝐺2, and likewise for any
vertices found in the path between that pair.

You might also like