Posted by **Derric** on Tuesday, May 1, 2012 at 11:41pm.

Describe the graph and why it is consistent with the matrix.

How many simple paths are there from vertex 1 to vertex 5? Explain.Which is the shortest of those paths?

Part II: Trees

Construct and describe a tree that indicates the following: A college president has 2 employees who answer directly to him or her, namely a vice president and provost. The vice president and provost each have an administrative assistant. Three deans answer to the provost, and the heads of finance and alumni relations answer to the vice president. Each dean oversees three department chairpersons, and each department chair oversees several faculty in each of their respective departments.

Suppose that the professional correspondences are the same as above, with the addition that there is also a direct working relationship between the college president and the head of alumni relations (it is not necessary to draw this). Would the graph still be a tree? Why or why not?

- Discreet MAth -
**MathMate**, Wednesday, May 2, 2012 at 5:11pm
"Three deans answer to the provost, and the heads of finance and alumni relations answer to the vice president."

and

"there is also a direct working relationship between the college president and the head of alumni relations"

Doesn't that mean there is a cycle?

Review the definition of a tree and make your conclusions.

## Answer This Question

## Related Questions

- Math - Construct a graph based on the adjacency matrix that appears below. Label...
- Discreet MAth - Describe the graph and why it is consistent with the matrix. How...
- Algebra - Identify the vertex and the axis of symmetry for the graph of y=5(x-2...
- maths - An ant must walk from one vertex of a cube to the "opposite" vertex (...
- math gr.10 - Hi! I have been stuck on this problem for the past 20 minutes. ...
- heelp math - A graph is constructed iteratively according to the following ...
- Algebra - Write an equation for the translation so the graph has the given ...
- Math - Prove that a simple graph with n >_ 2 vertices must have atleast two ...
- Math - Prove that a simple graph with n >_ 2 vertices must have atleast two ...
- math - Write down an expression for the number of binomial paths which cross a ...

More Related Questions