The number of edges connected to a particular vertex is called its degree. It can indicate how well connected a particular vertex is and its ability to quickly spread a message across a network.

Let's consider aGraph = (?, ?), where ? represents a set of vertices and ? represents a set of edges. Recall that aGraph has |?| vertices and |?| edges. If we divide the degree of a node by (|?| -1), it is called degree centrality:

Now, let's look at a specific example. Consider the following graph:

Now, in the preceding graph, vertex C has a degree of 4. Its degree centrality can be calculated as follows: