# Applications of Discrete Mathematics and Statistics in IT

**Question description**

· The following graph represents a portion of the subway system of a city. The vertices on the graph correspond to subway stations, and the edges correspond to the rails. Your job is to write a program for a cleaning car to efficiently clean this portion of the subway system.

a. Using Euler’s theorem, explain why it is possible to pass through all of the stations by traversing every rail only once.

b. Using Fleury’s algorithm, provide an optimal path to clean all the rails by passing through them only once.

c. Is it possible to find an optimal path described in question 3-b that starts on any station? Explain your answer.

d. Is it possible to find an optimal path described in question 3-b that starts and ends at the same station? Explain why or why not.

## Tutor Answer

Brown University

1271 Tutors

California Institute of Technology

2131 Tutors

Carnegie Mellon University

982 Tutors

Columbia University

1256 Tutors

Dartmouth University

2113 Tutors

Emory University

2279 Tutors

Harvard University

599 Tutors

Massachusetts Institute of Technology

2319 Tutors

New York University

1645 Tutors

Notre Dam University

1911 Tutors

Oklahoma University

2122 Tutors

Pennsylvania State University

932 Tutors

Princeton University

1211 Tutors

Stanford University

983 Tutors

University of California

1282 Tutors

Oxford University

123 Tutors

Yale University

2325 Tutors