This function and all of its descriptions have been obtained from the igraph package.

- graph
The graph to analyze (an igraph graph).

- v
The ids of vertices of which the degree will be calculated.

- mode
Character string, “out” for out-degree, “in” for in-degree or “total” for the sum of the two. For undirected graphs this argument is ignored. “all” is a synonym of “total”.

- loops
Logical; whether the loop edges are also counted. If the graph has a weight edge attribute, then this is used by default. Weights are used to calculate weighted shortest paths, so they are interpreted as distances.

- normalized
Logical scalar, whether to normalize the degree. If TRUE then the result is divided by n-1, where n is the number of vertices in the graph.

A numeric vector of the same length as argument v.

`ivi`

,
`cent_network.vis`

,
and `degree`

for a complete description on this function

Other centrality functions:
`betweenness()`

,
`clusterRank()`

,
`collective.influence()`

,
`h_index()`

,
`lh_index()`

,
`neighborhood.connectivity()`

,
`sirir()`

```
MyData <- coexpression.data
My_graph <- graph_from_data_frame(MyData)
GraphVertices <- V(My_graph)
My_graph_degree <- degree(My_graph, v = GraphVertices, normalized = FALSE)
```