Nested hierarchies in planar graphs
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...[Show more]
|Collections||ANU Research Publications|
|Source:||Discrete Applied Mathematics|
|01_Song_Nested_hierarchies_in_planar_2011.pdf||858.18 kB||Adobe PDF||Request a copy|
|02_Song_Nested_hierarchies_in_planar_2011.pdf||938.83 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.