Krackhardt kite graph

{{Infobox graph

| name = Krackhardt kite graph

| image = Krackhard kite.PNG

| vertices = 10

| edges = 18

| properties = Simple

}}

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.{{cite web |url=http://doc.sagemath.org/html/en/reference/graphs/sage/graphs/graph_generators.html#sage.graphs.graph_generators.GraphGenerators.M22Graph |title=Common Graphs |at=function "KrackhardtKiteGraph" |publisher=Sage Math |accessdate=19 August 2015}}{{MathWorld |title=Krackhardt Kite |id=KrackhardtKite}}

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.{{cite journal|title=Assessing the Political Landscape: Structure, Cognition, and Power in Organizations|first=David|last=Krackhardt|authorlink=David Krackhardt|journal=Administrative Science Quarterly|volume=35|issue=2|date=June 1990|pages=342–369|doi=10.2307/2393394|jstor=2393394}}