In Exercises 1-6, do the following: a. Determine the number of vertices edges, and loops in the given graph b. Draw another representation of the graph that looks significantly different. c. Find two adjacent edges. d. Find two adjacent vertices e. Find the degree of each vertex. f. Determine whether the graph is connected.

Question

Want to see more full solutions like this?

Answer 1

Textbook Question

Chapter 9.CR, Problem 1CR

In Exercises 1-6, do the following:
a.	Determine the number of vertices edges, and loops in the given graph
b.	Draw another representation of the graph that looks significantly different.
c.	Find two adjacent edges.
d.	Find two adjacent vertices
e.	Find the degree of each vertex.
f.	Determine whether the graph is connected.

Expert Solution

To determine

a)

The number of vertices, edges, and loops in the given graph.

Answer to Problem 1CR

Solution:

The number of vertices are 3, number of edges are 6, and number of loops is zero.

Explanation of Solution

Given:

The following figure shows the given diagram.

MATHEMATICS A PRACTICAL ODYSSEY W/ACCESS, Chapter 9.CR, Problem 1CR , additional homework tip 1

Figure (1)

Approach:

A graph is the diagram that consists of points, known as vertices, and connecting lines are known as edges. The edge that connects a vertex with itself is called a loop.

Therefore, the number of vertices are 3, number of edges are 6, and number of loops is zero.

Conclusion:

Hence, the number of vertices are 3, number of edges are 6, and number of loops is zero.

Expert Solution

To determine

b)

To draw:

The representation of the graph that looks significantly different.

Answer to Problem 1CR

Solution:

The representation of the graph that looks significantly different is shown in figure (2).

Explanation of Solution

Approach:

The significantly different representation is as follows,

Take three vertices as A, B and C. Connect A and B with two edges, A and C with two edges. Make an edge between B and C. To form a loop make an edge that connects the vertex B with each other as shown below.

MATHEMATICS A PRACTICAL ODYSSEY W/ACCESS, Chapter 9.CR, Problem 1CR , additional homework tip 2

Figure (2)

Therefore, the representation of the graph that looks significantly different is shown in figure (2).

Conclusion:

Hence, the representation of the graph that looks significantly different is shown in figure (2).

Expert Solution

To determine

c)

To find:

The two adjacent edges of the given figure.

Answer to Problem 1CR

Solution:

The adjacent sides are AB, BC.

Explanation of Solution

Approach:

Adjacent edges are the edges which have a common vertex.

In the above given figure the adjacent sides are AB, BC.

Therefore, the adjacent sides are AB, BC.

Conclusion:

Hence, the adjacent sides are AB, BC.

Expert Solution

To determine

d)

To find:

The two adjacent vertices.

Answer to Problem 1CR

Solution:

The vertices A and B, B and C are two adjacent vertices.

Explanation of Solution

Approach:

Two vertices will be adjacent if they are joined by an edge.

Thus in the above given figure Vertices A and B, B and C are two adjacent vertices.

Therefore, the vertices A and B, B and C are two adjacent vertices.

Conclusion:

Hence, the vertices A and B, B and C are two adjacent vertices.

Expert Solution

To determine

e)

To find:

The degree of each vertex.

Answer to Problem 1CR

Solution:

The degree of each vertex is shown in the table (1).

Explanation of Solution

Approach:

The degree of vertex is defined as the total number of edges that are connected to it.

The degree of vertex is shown in the following table.

Vertex	Degree
A	4
B	6
C	2

Table (1)

Therefore, the degree of each vertex is shown in the table (1).

Conclusion:

Hence, the degree of each vertex is shown in the table (1).

Expert Solution

To determine

f)

Whether the graph is connected or not.

Answer to Problem 1CR

Solution:

The given graph is said to be connected.

Explanation of Solution

Approach:

A graph will be connected if every pair of vertices in the graph is connected by a trail. A trail is sequence of adjacent vertices and the distinct edges that connect to them. Consider the above graph. There is a trail of A→B→C.

Therefore, the given graph is said to be connected.

Conclusion:

Hence, the given graph is said to be connected.

Want to see more full solutions like this?

Subscribe now to access step-by-step solutions to millions of textbook problems written by subject matter experts!

Students have asked these similar questions

Use a calculator to find a decimal approximation for the following trigonometric function. cot 226°54' cot 226°54' (Simplify your answer. Type an integer or a decimal. Round to eight decimal places as needed.)

In preparing for the upcoming holiday season, Fresh Toy Company (FTC) designed a new doll called The Dougie that teaches children how to dance. The fixed cost to produce the doll is $100,000. The variable cost, which includes material, labor, and shipping costs, is $31 per doll. During the holiday selling season, FTC will sell the dolls for $39 each. If FTC overproduces the dolls, the excess dolls will be sold in January through a distributor who has agreed to pay FTC $10 per doll. Demand for new toys during the holiday selling season is extremely uncertain. Forecasts are for expected sales of 60,000 dolls with a standard deviation of 15,000. The normal probability distribution is assumed to be a good description of the demand. FTC has tentatively decided to produce 60,000 units (the same as average demand), but it wants to conduct an analysis regarding this production quantity before finalizing the decision. (a) Determine the equation for computing FTC's profit for given values of the…

For all integers a and b, (a + b)^4 ≡ a^4 + b^4 (mod 4).

Answer 2

Textbook Question

Chapter 9.CR, Problem 1CR

In Exercises 1-6, do the following:
a.	Determine the number of vertices edges, and loops in the given graph
b.	Draw another representation of the graph that looks significantly different.
c.	Find two adjacent edges.
d.	Find two adjacent vertices
e.	Find the degree of each vertex.
f.	Determine whether the graph is connected.

Expert Solution

To determine

a)

The number of vertices, edges, and loops in the given graph.

Answer to Problem 1CR

Solution:

The number of vertices are 3, number of edges are 6, and number of loops is zero.

Explanation of Solution

Given:

The following figure shows the given diagram.

MATHEMATICS A PRACTICAL ODYSSEY W/ACCESS, Chapter 9.CR, Problem 1CR , additional homework tip 1

Figure (1)

Approach:

A graph is the diagram that consists of points, known as vertices, and connecting lines are known as edges. The edge that connects a vertex with itself is called a loop.

Therefore, the number of vertices are 3, number of edges are 6, and number of loops is zero.

Conclusion:

Hence, the number of vertices are 3, number of edges are 6, and number of loops is zero.

Expert Solution

To determine

b)

To draw:

The representation of the graph that looks significantly different.

Answer to Problem 1CR

Solution:

The representation of the graph that looks significantly different is shown in figure (2).

Explanation of Solution

Approach:

The significantly different representation is as follows,

Take three vertices as A, B and C. Connect A and B with two edges, A and C with two edges. Make an edge between B and C. To form a loop make an edge that connects the vertex B with each other as shown below.

MATHEMATICS A PRACTICAL ODYSSEY W/ACCESS, Chapter 9.CR, Problem 1CR , additional homework tip 2

Figure (2)

Therefore, the representation of the graph that looks significantly different is shown in figure (2).

Conclusion:

Hence, the representation of the graph that looks significantly different is shown in figure (2).

Expert Solution

To determine

c)

To find:

The two adjacent edges of the given figure.

Answer to Problem 1CR

Solution:

The adjacent sides are AB, BC.

Explanation of Solution

Approach:

Adjacent edges are the edges which have a common vertex.

In the above given figure the adjacent sides are AB, BC.

Therefore, the adjacent sides are AB, BC.

Conclusion:

Hence, the adjacent sides are AB, BC.

Expert Solution

To determine

d)

To find:

The two adjacent vertices.

Answer to Problem 1CR

Solution:

The vertices A and B, B and C are two adjacent vertices.

Explanation of Solution

Approach:

Two vertices will be adjacent if they are joined by an edge.

Thus in the above given figure Vertices A and B, B and C are two adjacent vertices.

Therefore, the vertices A and B, B and C are two adjacent vertices.

Conclusion:

Hence, the vertices A and B, B and C are two adjacent vertices.

Expert Solution

To determine

e)

To find:

The degree of each vertex.

Answer to Problem 1CR

Solution:

The degree of each vertex is shown in the table (1).

Explanation of Solution

Approach:

The degree of vertex is defined as the total number of edges that are connected to it.

The degree of vertex is shown in the following table.

Vertex	Degree
A	4
B	6
C	2

Table (1)

Therefore, the degree of each vertex is shown in the table (1).

Conclusion:

Hence, the degree of each vertex is shown in the table (1).

Expert Solution

To determine

f)

Whether the graph is connected or not.

Answer to Problem 1CR

Solution:

The given graph is said to be connected.

Explanation of Solution

Approach:

A graph will be connected if every pair of vertices in the graph is connected by a trail. A trail is sequence of adjacent vertices and the distinct edges that connect to them. Consider the above graph. There is a trail of A→B→C.

Therefore, the given graph is said to be connected.

Conclusion:

Hence, the given graph is said to be connected.

Want to see more full solutions like this?

Subscribe now to access step-by-step solutions to millions of textbook problems written by subject matter experts!

Answer 3

Textbook Question

Chapter 9.CR, Problem 1CR

In Exercises 1-6, do the following:
a.	Determine the number of vertices edges, and loops in the given graph
b.	Draw another representation of the graph that looks significantly different.
c.	Find two adjacent edges.
d.	Find two adjacent vertices
e.	Find the degree of each vertex.
f.	Determine whether the graph is connected.

Expert Solution

To determine

a)

The number of vertices, edges, and loops in the given graph.

Answer to Problem 1CR

Solution:

The number of vertices are 3, number of edges are 6, and number of loops is zero.

Explanation of Solution

Given:

The following figure shows the given diagram.

MATHEMATICS A PRACTICAL ODYSSEY W/ACCESS, Chapter 9.CR, Problem 1CR , additional homework tip 1

Figure (1)

Approach:

A graph is the diagram that consists of points, known as vertices, and connecting lines are known as edges. The edge that connects a vertex with itself is called a loop.

Therefore, the number of vertices are 3, number of edges are 6, and number of loops is zero.

Conclusion:

Hence, the number of vertices are 3, number of edges are 6, and number of loops is zero.

Expert Solution

To determine

b)

To draw:

The representation of the graph that looks significantly different.

Answer to Problem 1CR

Solution:

The representation of the graph that looks significantly different is shown in figure (2).

Explanation of Solution

Approach:

The significantly different representation is as follows,

Take three vertices as A, B and C. Connect A and B with two edges, A and C with two edges. Make an edge between B and C. To form a loop make an edge that connects the vertex B with each other as shown below.

MATHEMATICS A PRACTICAL ODYSSEY W/ACCESS, Chapter 9.CR, Problem 1CR , additional homework tip 2

Figure (2)

Therefore, the representation of the graph that looks significantly different is shown in figure (2).

Conclusion:

Hence, the representation of the graph that looks significantly different is shown in figure (2).

Expert Solution

To determine

c)

To find:

The two adjacent edges of the given figure.

Answer to Problem 1CR

Solution:

The adjacent sides are AB, BC.

Explanation of Solution

Approach:

Adjacent edges are the edges which have a common vertex.

In the above given figure the adjacent sides are AB, BC.

Therefore, the adjacent sides are AB, BC.

Conclusion:

Hence, the adjacent sides are AB, BC.

Expert Solution

To determine

d)

To find:

The two adjacent vertices.

Answer to Problem 1CR

Solution:

The vertices A and B, B and C are two adjacent vertices.

Explanation of Solution

Approach:

Two vertices will be adjacent if they are joined by an edge.

Thus in the above given figure Vertices A and B, B and C are two adjacent vertices.

Therefore, the vertices A and B, B and C are two adjacent vertices.

Conclusion:

Hence, the vertices A and B, B and C are two adjacent vertices.

Expert Solution

To determine

e)

To find:

The degree of each vertex.

Answer to Problem 1CR

Solution:

The degree of each vertex is shown in the table (1).

Explanation of Solution

Approach:

The degree of vertex is defined as the total number of edges that are connected to it.

The degree of vertex is shown in the following table.

Vertex	Degree
A	4
B	6
C	2

Table (1)

Therefore, the degree of each vertex is shown in the table (1).

Conclusion:

Hence, the degree of each vertex is shown in the table (1).

Expert Solution

To determine

f)

Whether the graph is connected or not.

Answer to Problem 1CR

Solution:

The given graph is said to be connected.

Explanation of Solution

Approach:

A graph will be connected if every pair of vertices in the graph is connected by a trail. A trail is sequence of adjacent vertices and the distinct edges that connect to them. Consider the above graph. There is a trail of A→B→C.

Therefore, the given graph is said to be connected.

Conclusion:

Hence, the given graph is said to be connected.

Want to see more full solutions like this?

Subscribe now to access step-by-step solutions to millions of textbook problems written by subject matter experts!

Answer 4

Textbook Question

Chapter 9.CR, Problem 1CR

In Exercises 1-6, do the following:
a.	Determine the number of vertices edges, and loops in the given graph
b.	Draw another representation of the graph that looks significantly different.
c.	Find two adjacent edges.
d.	Find two adjacent vertices
e.	Find the degree of each vertex.
f.	Determine whether the graph is connected.

Expert Solution

To determine

a)

The number of vertices, edges, and loops in the given graph.

Answer to Problem 1CR

Solution:

The number of vertices are 3, number of edges are 6, and number of loops is zero.

Explanation of Solution

Given:

The following figure shows the given diagram.

MATHEMATICS A PRACTICAL ODYSSEY W/ACCESS, Chapter 9.CR, Problem 1CR , additional homework tip 1

Figure (1)

Approach:

A graph is the diagram that consists of points, known as vertices, and connecting lines are known as edges. The edge that connects a vertex with itself is called a loop.

Therefore, the number of vertices are 3, number of edges are 6, and number of loops is zero.

Conclusion:

Hence, the number of vertices are 3, number of edges are 6, and number of loops is zero.

Expert Solution

To determine

b)

To draw:

The representation of the graph that looks significantly different.

Answer to Problem 1CR

Solution:

The representation of the graph that looks significantly different is shown in figure (2).

Explanation of Solution

Approach:

The significantly different representation is as follows,

Take three vertices as A, B and C. Connect A and B with two edges, A and C with two edges. Make an edge between B and C. To form a loop make an edge that connects the vertex B with each other as shown below.

MATHEMATICS A PRACTICAL ODYSSEY W/ACCESS, Chapter 9.CR, Problem 1CR , additional homework tip 2

Figure (2)

Therefore, the representation of the graph that looks significantly different is shown in figure (2).

Conclusion:

Hence, the representation of the graph that looks significantly different is shown in figure (2).

Expert Solution

To determine

c)

To find:

The two adjacent edges of the given figure.

Answer to Problem 1CR

Solution:

The adjacent sides are AB, BC.

Explanation of Solution

Approach:

Adjacent edges are the edges which have a common vertex.

In the above given figure the adjacent sides are AB, BC.

Therefore, the adjacent sides are AB, BC.

Conclusion:

Hence, the adjacent sides are AB, BC.

Expert Solution

To determine

d)

To find:

The two adjacent vertices.

Answer to Problem 1CR

Solution:

The vertices A and B, B and C are two adjacent vertices.

Explanation of Solution

Approach:

Two vertices will be adjacent if they are joined by an edge.

Thus in the above given figure Vertices A and B, B and C are two adjacent vertices.

Therefore, the vertices A and B, B and C are two adjacent vertices.

Conclusion:

Hence, the vertices A and B, B and C are two adjacent vertices.

Expert Solution

To determine

e)

To find:

The degree of each vertex.

Answer to Problem 1CR

Solution:

The degree of each vertex is shown in the table (1).

Explanation of Solution

Approach:

The degree of vertex is defined as the total number of edges that are connected to it.

The degree of vertex is shown in the following table.

Vertex	Degree
A	4
B	6
C	2

Table (1)

Therefore, the degree of each vertex is shown in the table (1).

Conclusion:

Hence, the degree of each vertex is shown in the table (1).

Expert Solution

To determine

f)

Whether the graph is connected or not.

Answer to Problem 1CR

Solution:

The given graph is said to be connected.

Explanation of Solution

Approach:

A graph will be connected if every pair of vertices in the graph is connected by a trail. A trail is sequence of adjacent vertices and the distinct edges that connect to them. Consider the above graph. There is a trail of A→B→C.

Therefore, the given graph is said to be connected.

Conclusion:

Hence, the given graph is said to be connected.

Want to see more full solutions like this?

Subscribe now to access step-by-step solutions to millions of textbook problems written by subject matter experts!

Answer 5

Textbook Question

Answer 6

Textbook Question

Answer 7

Expert Solution

To determine

a)

The number of vertices, edges, and loops in the given graph.

Answer to Problem 1CR

Solution:

The number of vertices are 3, number of edges are 6, and number of loops is zero.

Explanation of Solution

Given:

The following figure shows the given diagram.

MATHEMATICS A PRACTICAL ODYSSEY W/ACCESS, Chapter 9.CR, Problem 1CR , additional homework tip 1

Figure (1)

Approach:

A graph is the diagram that consists of points, known as vertices, and connecting lines are known as edges. The edge that connects a vertex with itself is called a loop.

Therefore, the number of vertices are 3, number of edges are 6, and number of loops is zero.

Conclusion:

Hence, the number of vertices are 3, number of edges are 6, and number of loops is zero.

Expert Solution

To determine

b)

To draw:

The representation of the graph that looks significantly different.

Answer to Problem 1CR

Solution:

The representation of the graph that looks significantly different is shown in figure (2).

Explanation of Solution

Approach:

The significantly different representation is as follows,

Take three vertices as A, B and C. Connect A and B with two edges, A and C with two edges. Make an edge between B and C. To form a loop make an edge that connects the vertex B with each other as shown below.

MATHEMATICS A PRACTICAL ODYSSEY W/ACCESS, Chapter 9.CR, Problem 1CR , additional homework tip 2

Figure (2)

Therefore, the representation of the graph that looks significantly different is shown in figure (2).

Conclusion:

Hence, the representation of the graph that looks significantly different is shown in figure (2).

Expert Solution

To determine

c)

To find:

The two adjacent edges of the given figure.

Answer to Problem 1CR

Solution:

The adjacent sides are AB, BC.

Explanation of Solution

Approach:

Adjacent edges are the edges which have a common vertex.

In the above given figure the adjacent sides are AB, BC.

Therefore, the adjacent sides are AB, BC.

Conclusion:

Hence, the adjacent sides are AB, BC.

Expert Solution

To determine

d)

To find:

The two adjacent vertices.

Answer to Problem 1CR

Solution:

The vertices A and B, B and C are two adjacent vertices.

Explanation of Solution

Approach:

Two vertices will be adjacent if they are joined by an edge.

Thus in the above given figure Vertices A and B, B and C are two adjacent vertices.

Therefore, the vertices A and B, B and C are two adjacent vertices.

Conclusion:

Hence, the vertices A and B, B and C are two adjacent vertices.

Expert Solution

To determine

e)

To find:

The degree of each vertex.

Answer to Problem 1CR

Solution:

The degree of each vertex is shown in the table (1).

Explanation of Solution

Approach:

The degree of vertex is defined as the total number of edges that are connected to it.

The degree of vertex is shown in the following table.

Vertex	Degree
A	4
B	6
C	2

Table (1)

Therefore, the degree of each vertex is shown in the table (1).

Conclusion:

Hence, the degree of each vertex is shown in the table (1).

Expert Solution

To determine

f)

Whether the graph is connected or not.

Answer to Problem 1CR

Solution:

The given graph is said to be connected.

Explanation of Solution

Approach:

A graph will be connected if every pair of vertices in the graph is connected by a trail. A trail is sequence of adjacent vertices and the distinct edges that connect to them. Consider the above graph. There is a trail of A→B→C.

Therefore, the given graph is said to be connected.

Conclusion:

Hence, the given graph is said to be connected.

Answer 8

Expert Solution

To determine

a)

The number of vertices, edges, and loops in the given graph.

Answer to Problem 1CR

Solution:

The number of vertices are 3, number of edges are 6, and number of loops is zero.

Explanation of Solution

Given:

The following figure shows the given diagram.

MATHEMATICS A PRACTICAL ODYSSEY W/ACCESS, Chapter 9.CR, Problem 1CR , additional homework tip 1

Figure (1)

Approach:

A graph is the diagram that consists of points, known as vertices, and connecting lines are known as edges. The edge that connects a vertex with itself is called a loop.

Therefore, the number of vertices are 3, number of edges are 6, and number of loops is zero.

Conclusion:

Hence, the number of vertices are 3, number of edges are 6, and number of loops is zero.

Answer 9

Expert Solution

Answer 10

Expert Solution

Answer 11

Expert Solution

Answer 12

To determine

a)

The number of vertices, edges, and loops in the given graph.

Answer 13

Answer to Problem 1CR

Solution:

The number of vertices are 3, number of edges are 6, and number of loops is zero.

Answer 14

Explanation of Solution

Given:

The following figure shows the given diagram.

MATHEMATICS A PRACTICAL ODYSSEY W/ACCESS, Chapter 9.CR, Problem 1CR , additional homework tip 1

Figure (1)

Approach:

A graph is the diagram that consists of points, known as vertices, and connecting lines are known as edges. The edge that connects a vertex with itself is called a loop.

Therefore, the number of vertices are 3, number of edges are 6, and number of loops is zero.

Conclusion:

Hence, the number of vertices are 3, number of edges are 6, and number of loops is zero.

Answer 15

Expert Solution

To determine

b)

To draw:

The representation of the graph that looks significantly different.

Answer to Problem 1CR

Solution:

The representation of the graph that looks significantly different is shown in figure (2).

Explanation of Solution

Approach:

The significantly different representation is as follows,

Take three vertices as A, B and C. Connect A and B with two edges, A and C with two edges. Make an edge between B and C. To form a loop make an edge that connects the vertex B with each other as shown below.

MATHEMATICS A PRACTICAL ODYSSEY W/ACCESS, Chapter 9.CR, Problem 1CR , additional homework tip 2

Figure (2)

Therefore, the representation of the graph that looks significantly different is shown in figure (2).

Conclusion:

Hence, the representation of the graph that looks significantly different is shown in figure (2).

Answer 16

Expert Solution

Answer 17

Expert Solution

Answer 18

Expert Solution

Answer 19

To determine

b)

To draw:

The representation of the graph that looks significantly different.

Answer 20

Answer to Problem 1CR

Solution:

The representation of the graph that looks significantly different is shown in figure (2).

Answer 21

Explanation of Solution

Approach:

The significantly different representation is as follows,

Take three vertices as A, B and C. Connect A and B with two edges, A and C with two edges. Make an edge between B and C. To form a loop make an edge that connects the vertex B with each other as shown below.

MATHEMATICS A PRACTICAL ODYSSEY W/ACCESS, Chapter 9.CR, Problem 1CR , additional homework tip 2

Figure (2)

Therefore, the representation of the graph that looks significantly different is shown in figure (2).

Conclusion:

Hence, the representation of the graph that looks significantly different is shown in figure (2).

Answer 22

Expert Solution

To determine

c)

To find:

The two adjacent edges of the given figure.

Answer to Problem 1CR

Solution:

The adjacent sides are AB, BC.

Explanation of Solution

Approach:

Adjacent edges are the edges which have a common vertex.

In the above given figure the adjacent sides are AB, BC.

Therefore, the adjacent sides are AB, BC.

Conclusion:

Hence, the adjacent sides are AB, BC.

Answer 23

Expert Solution

Answer 24

Expert Solution

Answer 25

Expert Solution

Answer 26

To determine

c)

To find:

The two adjacent edges of the given figure.

Answer 27

Answer to Problem 1CR

Solution:

The adjacent sides are AB, BC.

Answer 28

Explanation of Solution

Approach:

Adjacent edges are the edges which have a common vertex.

In the above given figure the adjacent sides are AB, BC.

Therefore, the adjacent sides are AB, BC.

Conclusion:

Hence, the adjacent sides are AB, BC.

Answer 29

Expert Solution

To determine

d)

To find:

The two adjacent vertices.

Answer to Problem 1CR

Solution:

The vertices A and B, B and C are two adjacent vertices.

Explanation of Solution

Approach:

Two vertices will be adjacent if they are joined by an edge.

Thus in the above given figure Vertices A and B, B and C are two adjacent vertices.

Therefore, the vertices A and B, B and C are two adjacent vertices.

Conclusion:

Hence, the vertices A and B, B and C are two adjacent vertices.

Answer 30

Expert Solution

Answer 31

Expert Solution

Answer 32

Expert Solution

Answer 33

To determine

d)

To find:

The two adjacent vertices.

Answer 34

Answer to Problem 1CR

Solution:

The vertices A and B, B and C are two adjacent vertices.

Answer 35

Explanation of Solution

Approach:

Two vertices will be adjacent if they are joined by an edge.

Thus in the above given figure Vertices A and B, B and C are two adjacent vertices.

Therefore, the vertices A and B, B and C are two adjacent vertices.

Conclusion:

Hence, the vertices A and B, B and C are two adjacent vertices.

Answer 36

Expert Solution

To determine

e)

To find:

The degree of each vertex.

Answer to Problem 1CR

Solution:

The degree of each vertex is shown in the table (1).

Explanation of Solution

Approach:

The degree of vertex is defined as the total number of edges that are connected to it.

The degree of vertex is shown in the following table.

Vertex	Degree
A	4
B	6
C	2

Table (1)

Therefore, the degree of each vertex is shown in the table (1).

Conclusion:

Hence, the degree of each vertex is shown in the table (1).

Answer 37

Expert Solution

Answer 38

Expert Solution

Answer 39

Expert Solution

Answer 40

To determine

e)

To find:

The degree of each vertex.

Answer 41

Answer to Problem 1CR

Solution:

The degree of each vertex is shown in the table (1).

Answer 42

Explanation of Solution

Approach:

The degree of vertex is defined as the total number of edges that are connected to it.

The degree of vertex is shown in the following table.

Vertex	Degree
A	4
B	6
C	2

Table (1)

Therefore, the degree of each vertex is shown in the table (1).

Conclusion:

Hence, the degree of each vertex is shown in the table (1).

Answer 43

Expert Solution

To determine

f)

Whether the graph is connected or not.

Answer to Problem 1CR

Solution:

The given graph is said to be connected.

Explanation of Solution

Approach:

A graph will be connected if every pair of vertices in the graph is connected by a trail. A trail is sequence of adjacent vertices and the distinct edges that connect to them. Consider the above graph. There is a trail of A→B→C.

Therefore, the given graph is said to be connected.

Conclusion:

Hence, the given graph is said to be connected.

Answer 44

Expert Solution

Answer 45

Expert Solution

Answer 46

Expert Solution

Answer 47

To determine

f)

Whether the graph is connected or not.

Answer 48

Answer to Problem 1CR

Solution:

The given graph is said to be connected.

Answer 49

Explanation of Solution

Approach:

A graph will be connected if every pair of vertices in the graph is connected by a trail. A trail is sequence of adjacent vertices and the distinct edges that connect to them. Consider the above graph. There is a trail of A→B→C.

Therefore, the given graph is said to be connected.

Conclusion:

Hence, the given graph is said to be connected.