**Authors:** Books Llc

**Categories:** Computers

**Type:** BOOK - **Published:** 2010-09 - **Publisher:** Books LLC, Wiki Series

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Pages: 31. Chapters: Centrality, Cayley graph, Clustering coefficient, Symmetric graph, Graph automorphism, Adjacency matrix, Modularity, Frucht's theorem, Kirchhoff's theorem, Incidence matrix, Distance-transitive graph, Conference matrix, Matching polynomial, Cycle space, Algebraic connectivity, Distance-regular graph, Strongly regular graph, Lov sz conjecture, Dual graph, Laplacian matrix, Spectral graph theory, Vertex-transitive graph, Ramanujan graph, Two-graph, Conductance, Semi-symmetric graph, Edge space, Ihara zeta function, Half-transitive graph, Edge-transitive graph, Seidel adjacency matrix, Adjacency algebra, Degree matrix, Parry-Sullivan invariant, Conference graph, Integral graph, Rank. Excerpt: Within graph theory and network analysis, there are various measures of the centrality of a vertex within a graph that determine the relative importance of a vertex within the graph (for example, how important a person is within a social network, or, in the theory of space syntax, how important a room is within a building or how well-used a road is within an urban network). There are four measures of centrality that are widely used in network analysis: degree centrality, betweenness, closeness, and eigenvector centrality. For a review as well as generalizations to weighted networks, see Opsahl et al. (2010). The