Angaben zur Quelle [Bearbeiten]
| Autor | Stephenson, Karen and Zelen, Marvin |
| Titel | Rethinking Centrality: Methods and Examples |
| Zeitschrift | Social Networks |
| Ausgabe | 11 |
| Jahr | 1989 |
| Seiten | 1-37 |
| URL | http://www.sciencedirect.com/science/article/pii/0378873389900166 |
Literaturverz. |
no |
| Fußnoten | no |
| Fragmente | 2 |
Fragmente der Quelle:
| [1.] Nm6/Fragment 478 44 - Diskussion Zuletzt bearbeitet: 2014-02-08 23:14:49 Hindemith | Fragment, Gesichtet, Nm6, SMWFragment, Schutzlevel sysop, Stephenson and Zelen 1989, Verschleierung |
|
|
|
| Untersuchte Arbeit: Seite: 478, Zeilen: 44-45 |
Quelle: Stephenson and Zelen 1989 Seite(n): 2, Zeilen: last paragraph |
|---|---|
| A review of key centrality concepts can be found in the papers by Freeman, et al. [9]. Their work has significantly contributed to the [conceptual clarification and theoretical application of centrality.]
9. Freeman, L.C., Freeman, S.C., Michaelson, A.G.: On Human Social Intelligence. Journal of Social and Biological Structures 11, 415–425 (1988) |
A review of key centrality concepts can be found in the papers by Freeman (1979a,b). His work has significantly contributed to the conceptual clarification and theoretical application of centrality.
Freeman, L.C. 1979 a “Centrality in Social Networks: Conceptual Clarification.” Social Networks I: 215-239. |
The reference to Freeman et al. is to a different paper, a group work that does not deal with centrality concepts. Stephenson & Zelen 1989 are not mentioned anywhere in the paper. To be continued on the next page: Nm6/Fragment_479_03 |
|
| [2.] Nm6/Fragment 479 03 - Diskussion Zuletzt bearbeitet: 2014-02-08 23:14:34 Hindemith | Fragment, Gesichtet, Nm6, SMWFragment, Schutzlevel sysop, Stephenson and Zelen 1989, Verschleierung |
|
|
|
| Untersuchte Arbeit: Seite: 479, Zeilen: 3-5 |
Quelle: Stephenson and Zelen 1989 Seite(n): 3, Zeilen: 1ff |
|---|---|
| This work was partially motivated by the structural properties of the center of a star graph. The most basic idea of degree centrality in a graph is the adjacency count of its constituent nodes. | His development is partially motivated by the structural properties of the center of a star graph. The most basic idea of point centrality in a graph is the adjacency count of its constituent points. |
The source is not given anywhere in the paper. The copied text begins on the previous page: Nm6/Fragment_478_44 |
|