Krackhardt kite graph

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search
Krackhardt kite graph
Krackhard kite.PNG
Vertices10
Edges18
PropertiesSimple
Table of graphs and parameters

In graph theory, the Krackhardt kite graph is a simple graph with ten nodes. The graph is named after David Krackhardt, a researcher of social network theory.[1][2]

Krackhardt introduced the graph in 1990 to distinguish different concepts of centrality. It has the property that the vertex with maximum degree (labeled 3 in the figure, with degree 6), the vertex with maximum betweenness centrality (labeled 7), and the two vertices with maximum closeness centrality (labeled 5 and 6) are all different from each other.[3]

References[edit]

  1. ^ "Common Graphs". Sage Math. function "KrackhardtKiteGraph". Retrieved 19 August 2015.
  2. ^ Weisstein, Eric W. "Krackhardt Kite". MathWorld.
  3. ^ Krackhardt, David (June 1990). "Assessing the Political Landscape: Structure, Cognition, and Power in Organizations". Administrative Science Quarterly. 35 (2): 342–369. doi:10.2307/2393394. JSTOR 2393394.