|
|
|
| Untersuchte Arbeit: Seite: 101, Zeilen: 20-26 |
Quelle: Koschuetzki_etal_2005 Seite(n): 20, Zeilen: 12-16 |
|---|---|
| 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 neighbours. | 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 source is not mentioned anywhere in the thesis. Note, that this paragraph can also be found in other publications of Nm: Memon, Larsen, Hicks & Harkiolakis (2008) and Memon, Hicks & Larsen (2007). Henrik Legind Larsen is the thesis supervisor and David L. Hicks is the thesis committee chairman. |
|