Graphs have degree sequences from "summary" of Introduction to Graph Theory by Douglas Brent West
A degree sequence of a graph is a list of the degrees of the vertices in the graph, ordered from smallest to largest. A graph can be determined by its degree sequence, making it an important tool in graph theory. Degree sequences can also be used to classify certain types of graphs.- Degree sequence is one important property of graphs as it reveals some basic information on how they are connected together.
- Graphs are structures that consist of edges and vertices, where the number of each type of vertex in a graph can be easily determined through looking at its degree sequence.
- Connections are expressed by indicating how many conflicts, or edges, occur between two vertices and how this differs across the entire graph.
- It is also useful when considering whether a graph is strongly connected, meaning that there exists at least one path between any two arbitrary vertices in the graph.
