Final answer:
The degree sequence of Kn is a list where each element is n-1 and appears n times, corresponding to the degree of each vertex in the complete graph Kn.
Step-by-step explanation:
The degree sequence of Kn, where n is a positive integer, refers to a list of degrees (number of connections) of all vertices in the complete graph Kn. A complete graph is one in which every vertex is connected to every other vertex with an edge. Thus, in a complete graph Kn, each vertex has a degree of n-1, since there are n vertices and each vertex is connected to all other n-1 vertices.
In a complete graph, this means that the degree sequence for Kn is a repetitive sequence where each term is n-1. Providing a specific example, for K4, the complete graph with 4 vertices, the degree sequence would be (3, 3, 3, 3), as each of the 4 vertices is connected to the other 3 vertices.