5.2. Degree Sequence of a Graph

The degree sequence of a graph is basically the sequence of degrees of the vertices in non increasing order. So, you list down the highest degree vertex or the degree of the highest vertex first followed by the next highest degree, followed by the next highest degree and so on.

The degree sequence is a way to represent the degrees of all the vertices in a graph. Each vertex has a degree, which is simply the number of edges connected to it. To form a degree sequence, we start by identifying the degree of each vertex and then organize these degrees from the highest to the lowest. This gives us a clear representation of how each vertex connects within the graph. For example, if we have a graph with vertices having degrees 3, 2, and 1, the degree sequence would be [3, 2, 1].

Think of a class of students in which each student has a different number of friends. If Student A has the most friends, followed by Student B, and then Student C, we can list their number of friends in order to show how socially connected they are. This ordered list resembles the degree sequence, illustrating the social network within the class.

A sequence of n values is called a graphic sequence, if you can construct a simple graph whose degree sequence is the given sequence. If you cannot draw any simple graph whose degree sequence is a given sequence, then the given sequence will not be called a graphic sequence.

A graphic sequence must satisfy certain conditions to ensure that it can correspond to a simple graph. A simple graph is one that does not have loops or multiple edges between the same pair of vertices. For a sequence to be graphic, one must be able to find a way to create a graph that matches the degree sequence exactly. If it's not possible to represent the sequence with any simple graph, then it is deemed non-graphic. This helps in validating whether the specified sequence is realizable or not.

Imagine trying to plan a party with a specific number of people, where some people can bring certain guests. If you plan for six guests but everyone can only bring one friend, and you try to assign more friends than can fit within the party structure, it becomes clear that you cannot create a valid plan for the party. Similar reasoning applies to graphic sequences; if the plan (sequence) cannot fit the rules (graph), it’s not viable.

For example, the sequence 5, 4, 3, 2, 1, 0 cannot represent a valid graph because if one vertex has degree 5, all remaining vertices must connect to it, reducing the degrees of others incorrectly. Conversely, a sequence where all vertices have degree 2 can represent a valid simple graph.

Let's explore the sequence 5, 4, 3, 2, 1, 0. If one vertex has a degree of 5, that means it is connected to five other vertices. However, if one of those vertices is supposed to have a degree of 0 (not connected), this creates a contradiction since having one vertex connected to five others cannot coexist with another vertex not being connected at all. Hence, this sequence cannot be graphic. In contrast, a sequence like 2, 2, 2, 2, 2 ensures that if each vertex connects to two others, it can form a valid triangle or cycles, thereby being a graphic sequence.

Consider a circular arrangement of people passing a ball. If everyone is supposed to pass to two other people (degree 2), it works perfectly. But if we say that one person should pass to five while another doesn’t receive at all (degree 0), the arrangement falls apart. Thus, successful coordination (graph) must have rules that allow all parties involved (vertices) to participate without contradictions.

The Havel-Hakimi theorem provides a method to determine whether a given sequence can construct a simple graph. The theorem describes a process of reduction where we remove the highest degree and adjust the subsequent degrees accordingly.

The Havel-Hakimi theorem is an algorithmic approach used to check if a sequence of integers can represent the degree sequence of a simple graph. The method involves taking the highest degree from the sequence, removing it, and then reducing the degrees of the next highest number of vertices by 1, corresponding to the count of the removed degree. This process continues iteratively. If, at any stage, you can no longer maintain non-negative degrees, or if you ultimately arrive at a sequence of zeros, then the original sequence is graphic.

Imagine a group of friends organizing a tournament. If the most competitive friend leaves and they have to adjust the competition structure (like reducing points for the next competitors), they must ensure that competition remains fair (all keeping non-negative scores). Just like in reducing the degrees in the theorem, the objective is to adjust until they find an arrangement suitable for everyone. If they get to a point of no one being able to compete anymore (negative scores), then original plans were not feasible.

--