arXiv · 0906.4826
Nested hierarchies in planar graphs
Abstract
We construct a partial order relation which acts on the set of 3-cliques of a maximal planar graph G and defines a unique hierarchy. We demonstrate that G is the union of a set of special subgraphs, named `bubbles', that are themselves maximal planar graphs. The graph G is retrieved by connecting these bubbles in a tree structure where neighboring bubbles are joined together by a 3-clique. Bubbles naturally provide the subdivision of G into communities and the tree structure defines the hierarchical relations between these communities.
Explore related subjects
Keep this discovery
Won-Min Song, T. Di Matteo, Tomaso Aste. 2009-06-26. Nested hierarchies in planar graphs. https://doi.org/10.1016/j.dam.2011.07.018
Cite the original work for its findings. Save a collection to share your selection of sources.