# Quelle:Nm6/Koschuetzki et al 2005

## < Quelle:Nm6

32.134Seiten in
diesem Wiki

Angaben zur Quelle [Bearbeiten]

 Autor D. Koschützki, K.A. Lehmann, L. Peeters, S. Richter, D. Tenfelde- Podehl, O. Zlotowski Titel Chapter 3 Centrality Indices Sammlung Network Analysis: Methodological Foundations Herausgeber Ulrik Brandes, Thomas Erlebach Ort Berlin Heidelberg Verlag Springer Jahr 2005 Seiten 16-61 ISBN 978-3-540-24979-5 ISSN 0302-9743 URL http://books.google.de/books?id=TTNhSm7HYrIC Literaturverz. no Fußnoten no Fragmente 1

Fragmente der Quelle:
 Zuletzt bearbeitet: 2014-02-11 01:34:16 Hindemith

 Typus KomplettPlagiat Bearbeiter Hindemith Gesichtet
Untersuchte Arbeit:
Seite: 479, Zeilen: 12-18
Quelle: Koschuetzki et al 2005
Seite(n): 20, Zeilen: 8ff
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. Sichter (Hindemith) Singulus