Search the whole station

# 离散数学代做 数学作业代做 数学图论代写 MATH作业代写

67

## MATH: Discrete Mathematics and Graph Theory

### Practice Class 7 离散数学代做

1. Let V = {1, 2, 3, 4, 5, 6}.

(a) The number of graphs with vertex set V is ________

(b) The number of graphs with vertex set V and 3 edges is ________

(c) The number of these 3-edge graphs which are connected is ________

(d) The minimum number of edges in a graph w/ vertex set V is ________

(e) Assuming connectedness, the minimum number of edges is ________

2. Complete the following definitions.

(a) Two graphs G = (V,E) and G′ = (V,E′ ) are isomorphic if there is a bijection f : V V′ such that ________

(b) A subgraph of G = (V,E) is a graph H = (W, F) where ________

(a) The number of edges in G is ________

(b) The number of connected components in G is ________

(c) The number of bridges in G is ________

(d) The number of 3-cycles in G is ________

(e) The number of subgraphs of G isomorphic to K4 is ________

(f) The number of edges in G a is ________

(g) The number of connected components in G a is ________

(h) The number of edges in the complement of G is ________

(i) The number of walks of length 1 in G from a to c is ________

(j) The number of walks of length 2 in G from a to c is ________

(k) The number of walks of length 3 in G from a to c is  ________

(l) The number of walks of length 2 in G from a to itself is ________

(m) The number of walks of length 3 in G from a to itself is ________

#### 4. 离散数学代做

In each of the following triples of graphs, two are isomorphic to each other, but the third graph belongs to a different isomorphism class. In the box, write which graph is in a different isomorphism class.

5. For each of the following statements, write T for true or F for false.

(a) Every graph is isomorphic to one with vertex set {1, 2, · · · , n} for some n.

(b) There are finitely many isomorphism classes of graphs.

(c) The complement of G has the same vertex set as G.

(d) The edge {v,w} of G is a bridge if and only if G − {v,w} has more connected components than G.

(e) If {v, w} is an edge of G, G − {v, w} never has fewer connected components than G.

(f) If v is a vertex of G, G v never has more connected components than G.

(g) If v is a vertex of G, G v never has fewer connected components than G.

(h) The complement of the complement of G is G itself.

### Practice Class 8 离散数学代做

1. Complete the following definitions.

(a) A connected graph is Eulerian if it has a walk which returns to its starting vertex and ________

(b) A connected graph with ≥ 3 vertices is Hamiltonian if it has a walk which returns to its starting vertex and ________

(a) Its degree sequence is ________

(b) Is it regular?

(c) Is it Eulerian?

(d) Is it Hamiltonian?

3. Consider the graphs P2,P3, P4,C3,C4,K4,K5.

(a) Which of them are regular?

(b) Which of them are Eulerian?

(c) Which of them have an Eulerian trail?

(d) Which of them are Hamiltonian?

#### 4. For each of the following sequences, say whether it is graphic or not graphic. 离散数学代做

(a) (0, 0, 0, 0)

(b) (0, 0, 1, 1)

(c) (0, 1, 1, 1)

(d) (0, 0, 2, 2)

(e) (3, 3, 3, 3)

(f) (2, 2, 2, 2, 2, 2, 2, 2)

(g) (3, 3, 3, 3, 3, 3, 3, 3, 3, 3)

(h) (0, 0, 1, 1, 2, 2, 3, 3, 3, 3)

(i) (1, 3, 3, 3, 5, 5)

5.For each of the following statements, write T for true or F for false.

(a) If a graph has degree sequence (1, 2, 2, 2, 3), the degree-3 vertex must be adjacent to all the degree-2 vertices.

(b) Any regular connected graph with ≥ 3 vertices is Hamiltonian.

(c) K2,2 is isomorphic to C4.

(d) A graph is Hamiltonian if and only if it contains a cycle.

(e) If v is a vertex of a Hamiltonian graph G, then Gv is connected.

(f) If G v is connected for every vertex v, then G is Hamiltonian.

(g) If v and w are non-adjacent vertices of a Hamiltonian graph G with n vertices, then deg(v) + deg(w) ≥ n.

(h) If, for every pair of vertices v and w of a connected graph G with n ≥ 3 vertices, deg(v)+deg(w) ≥ n, then G is Hamiltonian.

The prev:

### Related recommendations

• #### 博弈论作业代写 ECON 701代写 经济学作业代写 经济作业代写

9

ECON 701 MODULE 9 EXERCISES 博弈论作业代写 Exercise 1. Draw the following two trees and give the function p by specifying what p(x) is for each x in X for both trees. Exercise 1. Draw ...

View details
• #### 微观经济练习代写 ECON 701代写 微观经济作业代写 经济代写

16

ECON 701 MODULE 7 EXERCISES 微观经济练习代写 Exercise 1 (The Monty Hall Game). The example we now discuss is now fairly well known. The name comes from an American television game show, Ex...

View details
• #### 宏观经济理论与政策代写 ECON 711代写 宏观经济作业代写

16

ECON 711 Macroeconomic Theory and Policy Assignment 2 宏观经济理论与政策代写 Question 1. (2 points) Solow model in continuous time.Consider the Solow model in continuous time with productio...

View details
• #### 半群理论代考 MT5823代写 数学半群代考 数学考试代考

18

MT5823 Semigroup theory 半群理论代考 A block group is a semigroup S such that for every s ∈ S there exists at most one t ∈ S where sts = s and tst = t. 1. (a) State the definition of EXAM ...

View details
1