The complete m-partite graph 𝑲𝒏𝟏,𝒏𝟐,……,𝒏𝒎 has vertices partitioned into m subsets of 𝒏𝟏, 𝒏𝟐, … … , 𝒏𝒎 elements each, and vertices are adjacent if and only if they are in different subsets in the partition. For example, if m=2, it is our ever-trusting friend, a complete bipartite graph. a. Draw these graphs: i. 𝑲𝟏,𝟐,𝟑 ii. 𝑲𝟐,𝟐,𝟑 iii. 𝑲𝟒,𝟒,𝟓,𝟏 b. How many vertices and how many edges does the complete 𝑲𝒏𝟏,𝒏𝟐,……,𝒏𝒎 have?
The Answer to the Question
is below this banner.
Here's the Solution to this Question
the degree of the top of the i-th share
the sum of the degrees of the vertex of the i-th part
sum of degrees of all vertices
the number of edges in the graph