# Nm2/Fragment 436 05

## < Nm2

32.145Seiten in
diesem Wiki

 Typus KomplettPlagiat Bearbeiter Hindemith Gesichtet
Untersuchte Arbeit:
Seite: 436, Zeilen: 5-11
Quelle: Koschuetzki et al 2005
Seite(n): 20, Zeilen: 8-16
The degree centrality Cd(v) of a vertex v is simply defined as the degree d(v) of v if the considered graph is undirected. The degree centrality is, e.g., applicable whenever the graph represents something like a voting result. These networks represent a static situation and we are interested in the vertex that has the most direct votes or that can reach most other vertices directly. The degree centrality is a local measure, because the centrality value of a vertex is only determined by the number of its neighbors. The most simple centrality is the degree centrality cD(v) of a vertex v that is simply defined as the degree d(v) of v if the considered graph is undirected. [...] The degree centrality is, e.g., applicable whenever the graph represents something like a voting result. These networks represent a static situation and we are interested in the vertex that has the most direct votes or that can reach most other vertices directly. The degree centrality is a local measure, because the centrality value of a vertex is only determined by the number of its neighbors.
 Anmerkungen The source is not mentioned anywhere in the paper. Sichter (Hindemith), WiseWoman