Book embeddings of Reeb graphs

12/05/2013
by   Vitaliy Kurlin, et al.
0

Let X be a simplicial complex with a piecewise linear function f:X→R. The Reeb graph Reeb(f,X) is the quotient of X, where we collapse each connected component of f^-1(t) to a single point. Let the nodes of Reeb(f,X) be all homologically critical points where any homology of the corresponding component of the level set f^-1(t) changes. Then we can label every arc of Reeb(f,X) with the Betti numbers (β_1,β_2,...,β_d) of the corresponding d-dimensional component of a level set. The homology labels give more information about the original complex X than the classical Reeb graph. We describe a canonical embedding of a Reeb graph into a multi-page book (a star cross a line) and give a unique linear code of this book embedding.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/23/2019

Parameterized Algorithms for Book Embedding Problems

A k-page book embedding of a graph G draws the vertices of G on a line a...
research
03/27/2018

On Dispersable Book Embeddings

In a dispersable book embedding, the vertices of a given graph G must be...
research
03/17/2020

Book Embeddings of Nonplanar Graphs with Small Faces in Few Pages

An embedding of a graph in a book, called book embedding, consists of a ...
research
07/23/2019

Local and Union Page Numbers

We introduce the novel concepts of local and union book embeddings, and,...
research
03/19/2019

Upward Book Embeddings of st-Graphs

We study k-page upward book embeddings (kUBEs) of st-graphs, that is, bo...
research
08/22/2017

Upward Partitioned Book Embeddings

We analyze a directed variation of the book embedding problem when the p...
research
08/21/2020

Schematic Representation of Large Biconnected Graphs

Suppose that a biconnected graph is given, consisting of a large compone...

Please sign up or login with your details

Forgot password? Click here to reset