Nested hierarchies in planar graphs

Mathematics – Geometric Topology

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

10.1016/j.dam.2011.07.018

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Nested hierarchies in planar graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Nested hierarchies in planar graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Nested hierarchies in planar graphs will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-670385

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.