Degree Centrality (Pillar Page)

Degree Centrality is a graph metric measuring the number of direct connections (edges) of a given node in a knowledge graph. The node with the highest degree centrality is a natural candidate for a Pillar Page — a full page that covers a topic broadly and links to many subtopics (supporting pages). In SEO, degree centrality translates directly to internal linking architecture: a page with 20 connections should link to 20 subpages. Degree Centrality is simpler than betweenness centrality; it measures a node's 'popularity,' not its role as a bridge.

For example, the entity 'Inheritance Law' with 15 connections (forced heirship, wills, intestate succession, inheritance tax...) naturally becomes a pillar page. In Neo4j, you calculate degree centrality with one Cypher query: MATCH (n)-[r]-(m) RETURN n, count(r) ORDER BY count(r) DESC.

In practice, map the top 5 nodes with the highest degree. These are your pillar pages; ensure each physically links to all subtopics indicated by the graph.