0
Which value determines if a switch becomes the central point of reference in the spanning tree topology?
Wiki User
∙ 14y ago
Spanning Tree Election Criteria
Spanning Tree builds paths out from a central point along the fastest available links. It selects path according to the following criteria:
1. Lowest root bridge ID (BID)
2. Lowest path cost to the root
3. Lowest sender bridge ID
4. Lowest sender port ID (PID)
Therefore, the answer to your question is Lower Bridge ID
Wiki User
∙ 14y ago
Add your answer:
Earn +20 pts
What polygon has five points?
it becomes a Star polygon
What is the rule for a 180 degree counterclockwise rotation?
First of all, if the rotation is 180 degrees then there is no difference clockwise and anti-clockwise so the inclusion of clockwise in the question is redundant. In terms of the coordinate plane, the signs of all coordinates are switched: from + to - and from - to +. So (2, 3) becomes (-2, -3), (-2, 3) becomes (2, -3), (2, -3) becomes (-2, 3) and (-2, -3) becomes (2, 3).
How many square vertices does a rhombus have?
Generally none. But it can have four when it becomes a square.
What is the significance of the intersection of the red and green curves?
Consumption becomes greater than supply
What statement concerning the water molecule in the equation is true?
It is spilt and becomes part of the product molecules
A switch becomes the central point of reference in the spanning tree topology?
lowest bridge ID
What variable determines wether a protostar becomes a star?
mass
What determines if a lymphocyte becomes a B cell or a T cell?
Where it is produced
What are the main factors which determines if a star becomes a black hole?
The mass of the host star.
How does a government involved in a centrally planned?
The type of government determines how a government becomes centrally planned.
What determines a star becomes a white dwarf neutron star or a black hole?
its original mass when it formed
What determines how the Vince president becomes president if the need arise?
If the president passes away, resigns, or is impeached.
What determines when a star is born?
A star becomes a star - "is born" - when the process of nuclear fusion begins in the core of the star.
What determines the onset of AIDS in an HIV-infected person?
The helper T cell count becomes very low
What determines the onset of AIDS in an hiv infected person?
The helper T cell count becomes very low
Prove that a graph G is connected if and only if it has a spanning tree?
Proving this is simple. First, you prove that G has a spanning tree, it is connected, which is pretty obvious - a spanning tree itself is already a connected graph on the vertex set V(G), thus G which contains it as a spanning sub graph is obviously also connected. Second, you prove that if G is connected, it has a spanning tree. If G is a tree itself, then it must "contain" a spanning tree. If G is connected and not a tree, then it must have at least one cycle. I don't know if you know this or not, but there is a theorem stating that an edge is a cut-edge if and only if it is on no cycle (a cut-edge is an edge such that if you take it out, the graph becomes disconnected). Thus, you can just keep taking out edges from cycles in G until all that is left are cut-gees. Since you did not take out any cut-edges, the graph is still connected; since all that is left are cut-edges, there are no cycles. A connected graph with no cycles is a tree. Thus, G contains a spanning tree. Therefore, a graph G is connected if and only if it has a spanning tree!
Prove that a graph G is connected and only if it has a spanning tree?
Proving this is simple. First, you prove that G has a spanning tree, it is connected, which is pretty obvious - a spanning tree itself is already a connected graph on the vertex set V(G), thus G which contains it as a spanning sub graph is obviously also connected. Second, you prove that if G is connected, it has a spanning tree. If G is a tree itself, then it must "contain" a spanning tree. If G is connected and not a tree, then it must have at least one cycle. I don't know if you know this or not, but there is a theorem stating that an edge is a cut-edge if and only if it is on no cycle (a cut-edge is an edge such that if you take it out, the graph becomes disconnected). Thus, you can just keep taking out edges from cycles in G until all that is left are cut-gees. Since you did not take out any cut-edges, the graph is still connected; since all that is left are cut-edges, there are no cycles. A connected graph with no cycles is a tree. Thus, G contains a spanning tree. Therefore, a graph G is connected if and only if it has a spanning tree!
