answersLogoWhite

0

125 according to Cayley's formula for counting spanning trees.

For a complete graph Kn,

t(kn) = nn-2

where n is the number of vertices.

User Avatar

Wiki User

15y ago

What else can I help you with?

Related Questions

How many spanning trees can be drawn with 5 labeled vertices?

No of spanning trees in a complete graph Kn is given by n^(n-2) so for 5 labelled vertices no of spanning trees 125


How many diagonals can be drawn from anyone vertex?

Three fewer than the total number of vertices.


How many triangles can be formed by a diagonal drawn from a fixed vertex of a polygon with 17 sides?

In a polygon with 17 sides, a diagonal can be drawn from a fixed vertex to any of the other non-adjacent vertices. From one vertex, there are 14 other vertices (17 total vertices - 1 fixed vertex - 2 adjacent vertices) to which diagonals can be drawn. Each diagonal creates a triangle with the fixed vertex and two of the vertices connected by the diagonal. Therefore, the number of triangles that can be formed is equal to the number of diagonals, which is 14.


What is the number of diagonals that can be drawn from one vertex in a convex polygon that has n vertices?

N-2 according to yahoo answers


How many vertical lines in regular octagon?

A regular octagon has 8 sides and 8 vertices. To determine the number of vertical lines that can be drawn through its vertices, we consider the symmetry of the shape. In a regular octagon, there are 2 vertical lines of symmetry that can be drawn through pairs of opposite vertices. Therefore, there are 2 vertical lines in a regular octagon.


What is the formula for the number of diagonals in a polygon?

Suppose a polygon has n vertices (and sides).From each vertex, a diagonal can be drawn to all vertices, excluding itself and the two adjacent vertices. So n-3 diagonals can be drawn from each vertex.Multiplying by the full complement of n vertices gives n(n-3). However, as things stand we have counted each diagonal twice: once at both ends. Dividing by two gives the actual number of diagonals.number of diagonals = n(n-3)/2


How do you find diagonals in a polygon?

Suppose a polygon has n vertices (and sides). From each vertex, a diagonal can be drawn to all vertices, excluding itself and the two adjacent vertices. So n-3 diagonals can be drawn from each vertex. Multiplying by the full complement of n vertices gives n(n-3). However, as things stand we have counted each diagonal twice: once at both ends. Dividing by two gives the actual number of diagonals. number of diagonals = n(n-3)/2


How many triangles will be formed in a 100 sided polygon if the diagonals are drawn from a vertex?

In a 100-sided polygon, if diagonals are drawn from one vertex, they connect to all non-adjacent vertices. A vertex connects to 97 other vertices (100 total vertices minus the 1 vertex itself and the 2 adjacent vertices). The number of triangles formed with the diagonals from that vertex is given by the formula for combinations, specifically ( \binom{97}{2} ), which equals 4,656 triangles.


What is the name of a line drawn between to vertices?

The line is called a diagonal if it is drawn between two nonadjacent angles.


How many diagonals can be drawn from a vertex of an octagon?

In an octagon, each vertex can connect to other vertices except itself and its two adjacent vertices. Since there are 8 vertices in total, a vertex can connect to (8 - 3 = 5) other vertices to form diagonals. Therefore, from each vertex of an octagon, 5 diagonals can be drawn.


What is a line drawn between 2 vertices?

If between two adjacent vertices then in 2-dimensions it is a side, in 3-d and edge. If between non-adjacent vertices, a diagonal.


How many heptagons can be drawn by joining the vertices of a polygon with 10 sides?

120