Classroom Note: An Application of Edge Clustering Centrality to Brain Connectivity

Joy Lind, Frank Garcea, Bradford Z. Mahon, Roger Vargas Jr., Darren A. Narayan
2017 Bulletin of the Institute of Combinatorics and its Applications  
Edge clustering centrality measures the frequency an edge appears across the closed neighborhoods over all vertices. This problem is analogous to the structural graph theory problem of finding the maximum sized book graph (K2 ∨ mK1, m ≥ 1) in a given graph.
dblp:journals/bullica/LindGMVN17 fatcat:6qlbvj4hiffwnm6vtudeqswqoi