Filters
Question type
Study Flashcards

Is it possible to construct a graph consisting of two vertices of even degree and three vertices of odd degree? Explain.

Correct Answer

verifed

verified

No. A graph will alw...

View Answer

Tom is dancing at a local discothèque with his friends Matt, Bill, Lisa, and Allison. Tom dances with Lisa once and Allison twice. Bill dances with Lisa two times but does not dance with Allison, and Matt dances with Lisa and Allison one time each. Using people as vertices and dances as edges construct a graph which models this situation.

Correct Answer

verifed

verified

Here is one renderin...

View Answer

Consider the graph with vertex set Consider the graph with vertex set ={A, B, C, D, E, F} and edge set = What is the degree of vertex E ? ={A, B, C, D, E, F} and edge set Consider the graph with vertex set ={A, B, C, D, E, F} and edge set = What is the degree of vertex E ? = Consider the graph with vertex set ={A, B, C, D, E, F} and edge set = What is the degree of vertex E ? What is the degree of vertex E ?

Correct Answer

verifed

verified

5

-Consider the graph above ; state the degree of vertex A. -Consider the graph above ; state the degree of vertex A.

Correct Answer

verifed

verified

The graph below does not contain an Euler Circuit. If an optimal Eulerization is found for the graph, then how many edges will be traveled over a second time? The graph below does not contain an Euler Circuit. If an optimal Eulerization is found for the graph, then how many edges will be traveled over a second time? A) 1 B) 2 C) 3 D) 4 E) None of the above.


A) 1
B) 2
C) 3
D) 4
E) None of the above.

F) All of the above
G) A) and B)

Correct Answer

verifed

verified

Consider the graph with vertex set V = {A,,BC,X,Y,Z} and edge set E = {ABA,,CAY,AX,BYC,C,CZ}. Which edges, if any, are bridges for the graph?

Correct Answer

verifed

verified

Jim and John decide to play a game. Jim draws a shape consisting only of lines and he asks John to put his pencil on the drawing and trace each and every line once and only once, without lifting his pencil. Is John able to complete this task? Explain. Jim and John decide to play a game. Jim draws a shape consisting only of lines and he asks John to put his pencil on the drawing and trace each and every line once and only once, without lifting his pencil. Is John able to complete this task? Explain.

Correct Answer

verifed

verified

No, as the drawing can be thou...

View Answer

-Consider the graph above ; what is the vertex set? A) A, B, C, D, E, F, G B) A, A, B, B, B, C, C, C, D, D, D, E, E, E, F, F, G, G C) A B, A D, B C, B D, C D, C E, E F, E G, F G D) A B, A D, B C, B D, C D, E F, F G E) None of the above. -Consider the graph above ; what is the vertex set?


A) A, B, C, D, E, F, G
B) A, A, B, B, B, C, C, C, D, D, D, E, E, E, F, F, G, G
C) A B, A D, B C, B D, C D, C E, E F, E G, F G
D) A B, A D, B C, B D, C D, E F, F G
E) None of the above.

F) A) and D)
G) A) and B)

Correct Answer

verifed

verified

-Consider the graph above ; state the vertex set. -Consider the graph above ; state the vertex set.

Correct Answer

verifed

verified

Consider the graph with vertex set Consider the graph with vertex set ={G, H, O, S, T} and edge set = {G H, G S, G S, G T, H O, O T, S T} . Which edges, if any, are bridges for the graph? A) G H B) G H and G T C) O T D) All of the edges. E) None of the above. ={G, H, O, S, T} and edge set Consider the graph with vertex set ={G, H, O, S, T} and edge set = {G H, G S, G S, G T, H O, O T, S T} . Which edges, if any, are bridges for the graph? A) G H B) G H and G T C) O T D) All of the edges. E) None of the above. = {G H, G S, G S, G T, H O, O T, S T} . Which edges, if any, are bridges for the graph?


A) G H
B) G H and G T
C) O T
D) All of the edges.
E) None of the above.

F) All of the above
G) B) and E)

Correct Answer

verifed

verified

Your college campus has designed an underground tumnel system to connect five of the main buildings on campus. A map of the underground system is shown below. Suppose that you start in Meconi Hall, end in The Glasgow Center, and plan to travel through each and every tunnel, what is the fewest number of tunnels that you would need to travel through more than once in order to accomplish this task? Your college campus has designed an underground tumnel system to connect five of the main buildings on campus. A map of the underground system is shown below. Suppose that you start in Meconi Hall, end in The Glasgow Center, and plan to travel through each and every tunnel, what is the fewest number of tunnels that you would need to travel through more than once in order to accomplish this task? A) 0 B) 1 C) 2 D) 3 E) None of the above.


A) 0
B) 1
C) 2
D) 3
E) None of the above.

F) B) and C)
G) A) and B)

Correct Answer

verifed

verified

B

Consider the graph with vertex set Consider the graph with vertex set ={A, B, C, D, E, F} and edge set = {AB, AB, AC, AE, AF, BD, BF, CD, CE, DF, EE, EF} . List all edges adjacent to edge D F . ={A, B, C, D, E, F} and edge set Consider the graph with vertex set ={A, B, C, D, E, F} and edge set = {AB, AB, AC, AE, AF, BD, BF, CD, CE, DF, EE, EF} . List all edges adjacent to edge D F .= {AB, AB, AC, AE, AF, BD, BF, CD, CE, DF, EE, EF} . List all edges adjacent to edge D F .

Correct Answer

verifed

verified

How many edges are bridges in the following grapgh ? How many edges are bridges in the following grapgh ?

Correct Answer

verifed

verified

For the graph shown below, which vertices are adjacent to vertex C? For the graph shown below, which vertices are adjacent to vertex C?

Correct Answer

verifed

verified

Jim and John decide to play a game. Jim draws a shape consisting only of lines and he asks John to put his pencil on the drawing and trace each and every line once and only once, without lifting his pencil. Is John able to complete this task? Jim and John decide to play a game. Jim draws a shape consisting only of lines and he asks John to put his pencil on the drawing and trace each and every line once and only once, without lifting his pencil. Is John able to complete this task? A) Yes B) No


A) Yes
B) No

C) A) and B)
D) undefined

Correct Answer

verifed

verified

Consider the graph with vertex set V = {A,,BC,X,Y,Z} and edge set E = {ABA,,CAY,AX,BYC,C,CZ}. Does this graph contain an Euler Path? Explain.

Correct Answer

verifed

verified

Yes. The graph is co...

View Answer

Consider the graph with vertex set Consider the graph with vertex set ={G, H, O, S, T} and edge set = {G H, G S, G S, G T, H O, O T, S T} . This graph A) contains at least one Euler Path. B) contain at least one Euler Circuit. C) is connected but does not contain either an Euler Path or an Euler Circuit. D) is not connected. E) None of the above. ={G, H, O, S, T} and edge set Consider the graph with vertex set ={G, H, O, S, T} and edge set = {G H, G S, G S, G T, H O, O T, S T} . This graph A) contains at least one Euler Path. B) contain at least one Euler Circuit. C) is connected but does not contain either an Euler Path or an Euler Circuit. D) is not connected. E) None of the above. = {G H, G S, G S, G T, H O, O T, S T} . This graph


A) contains at least one Euler Path.
B) contain at least one Euler Circuit.
C) is connected but does not contain either an Euler Path or an Euler Circuit.
D) is not connected.
E) None of the above.

F) C) and D)
G) B) and C)

Correct Answer

verifed

verified

Consider the graph with vertex set Consider the graph with vertex set and edge set What is the degree of vertex H ? A) 0 B) 1 C) 2 D) 3 E) None of the above. and edge set Consider the graph with vertex set and edge set What is the degree of vertex H ? A) 0 B) 1 C) 2 D) 3 E) None of the above. What is the degree of vertex H ?


A) 0
B) 1
C) 2
D) 3
E) None of the above.

F) C) and D)
G) A) and B)

Correct Answer

verifed

verified

C

-Consider the graph above ; how many circuits consisting of three edges are there which involve vertex A? -Consider the graph above ; how many circuits consisting of three edges are there which involve vertex A?

Correct Answer

verifed

verified

2, if you do not count mirror ...

View Answer

How many edges are bridges in the following graph? How many edges are bridges in the following graph? A) 0 B) 1 C) 2 D) 3 E) None of the above.


A) 0
B) 1
C) 2
D) 3
E) None of the above.

F) A) and B)
G) B) and E)

Correct Answer

verifed

verified

Showing 1 - 20 of 37

Related Exams

Exam 1

The Mathematics of Elections: the Paradoxes of Democracy

40 Questions

Exam 2

The Mathematics of Power: Weighted Voting

40 Questions

Exam 3

The Mathematics of Sharing: Fair-Division Games

38 Questions

Exam 4

The Mathematics of Apportionment: Making the Rounds

40 Questions

Exam 6

The Mathematics of Touring: Traveling Salesman Problems

40 Questions

Exam 7

The Cost of Being Connected

40 Questions

Exam 8

The Mathematics of Scheduling: Chasing the Critical Path

40 Questions

Exam 9

Population Growth Models: There Is Strength in Numbers

40 Questions

Exam 10

Financial Mathematics: Money Matters

40 Questions

Exam 11

The Mathematics of Symmetry: Beyond Reflection

40 Questions

Exam 12

Fractal Geometry: the Kinky Nature of Nature

39 Questions

Exam 13

Fibonacci Numbers and the Golden Ratio: Tales of Rabbits and Gnomons

40 Questions

Exam 14

Censuses, Surveys, Polls, and Studies: the Joys of Collecting Data

40 Questions

Exam 15

Graphs, Charts, and Numbers: the Data Show and Tell

40 Questions

Exam 16

Probabilities, Odds, and Expectations: Measuring Uncertainty and Risk

40 Questions

Exam 17

The Mathematics of Normality: the Call of the Bell

40 Questions

Show Answer