Graph centrality a'la Harary
Bug #398488 reported by
Gábor Csárdi
This bug affects 1 person
| Affects | Status | Importance | Assigned to | Milestone | |
|---|---|---|---|---|---|
| igraph |
New
|
Undecided
|
Unassigned | ||
Bug Description
Hage, P. and Harary, F. Eccentricity and Centrality in Networks. Social Networks 17, 57-63, 1995.
Graph centrality is defined as the distance to the farthest vertex from the vertex in question.
Revision history for this message
| Gábor Csárdi (gabor.csardi) wrote Continue on github | #1 |
To post a comment you must log in.
The development of igraph has moved to github, so please do not comment on this bug here. You are of course welcome to comment on github, here:
https:/