The Irreducible Spine(s) of Undirected Networks


Using closure and neighborhood concepts, we show that within every undirected network, or graph, there is a unique irreducible subgraph which we call its “spine”. The chordless cycles which comprise this irreducible core effectively characterize the connectivity structure of the network as a whole. In particular, it is shown that the center of the network… (More)
DOI: 10.1007/978-3-642-41154-0_8

7 Figures and Tables


  • Presentations referencing similar topics