2018
DOI: 10.12775/tmna.2018.029
|View full text |Cite
|
Sign up to set email alerts
|

Realization of a graph as the Reeb graph of a Morse function on a manifold

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

2
33
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
7
1

Relationship

1
7

Authors

Journals

citations
Cited by 22 publications
(35 citation statements)
references
References 9 publications
2
33
0
Order By: Relevance
“…The Reeb graph R(f ) of a Morse function f : M → R, as an invariant of the pair (M, f ), is a tool of global analysis attracting more attention recently due to its applications to computer graphics as well as its importance to purely mathematical problems (for more details see [2,5,7,8,18,19,23]). It is constructed by contracting the connected components of levels sets of the function f .…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…The Reeb graph R(f ) of a Morse function f : M → R, as an invariant of the pair (M, f ), is a tool of global analysis attracting more attention recently due to its applications to computer graphics as well as its importance to purely mathematical problems (for more details see [2,5,7,8,18,19,23]). It is constructed by contracting the connected components of levels sets of the function f .…”
Section: Introductionmentioning
confidence: 99%
“…The corank of a finitely generated group G is the maximal rank r for which there exists an epimorphism G → F r . As it was defined in [19] for closed manifolds, the Reeb number R(W ) of W denotes the maximal number of cycles in Reeb graphs of Morse functions f : W → R which are constant on the connected components of ∂W . In other words, R(W ) is the maximal rank of the Reeb epimorphism of such a Morse function on W .…”
Section: Introductionmentioning
confidence: 99%
“…It is worth mentioning that graph theory is often used to study Morse functions, for example, Reeb graphs are important for exploring Morse functions over manifolds, see, for instance, [4,7,12,13] and references therein. Reeb graphs are used also in computer graphics, see [4].…”
Section: Theoremmentioning
confidence: 99%
“…In [12], conditions are indicated under which Reeb graph is a tree. In [7,13], the authors provide the upper bound for the number of cycles in Reeb graphs and prove that the upper bound is sharp. (Compare with the main theorems in this article.)…”
Section: Theoremmentioning
confidence: 99%
“…In general, if f : M → R is an arbitrary smooth function with isolated critical points, then a certain part of its "combinatorial symmetries" is reflected by the so-called Kronrod-Reeb graph ∆ f , see, e.g., [2,3,18,19,26,33,35,38] and Section 2.3. Such a graph is obtained by shrinking each connected component of each level set f −1 (c), c ∈ R, of f into a point.…”
Section: Introductionmentioning
confidence: 99%