Generating discrete Morse functions from point data.

King, Henry; Knudson, Kevin; Mramor, Neža

Displaying similar documents to “Generating discrete Morse functions from point data.”

Discrete Morse inequalities on infinite graphs.

Ayala, Rafael, Fernández, Luis M., Vilches, José A. (2009)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Three manifestations of Morse theory in two dimensions

Vladimir N. Grujić (2011)

The Teaching of Mathematics

Similarity:

On cotree-critical and DFS cotree-critical graphs.

de Fraysseix, Hubert, Ossona de Mendez, Patrice (2003)

Journal of Graph Algorithms and Applications

Similarity:

Existence of multiple critical points for an asymptotically quadratic functional with applications.

Li, Shujie, Su, Jiabao (1996)

Abstract and Applied Analysis

Similarity:

The Connectivity Of Domination Dot-Critical Graphs With No Critical Vertices

Michitaka Furuya (2014)

Discussiones Mathematicae Graph Theory

Similarity:

An edge of a graph is called dot-critical if its contraction decreases the domination number. A graph is said to be dot-critical if all of its edges are dot-critical. A vertex of a graph is called critical if its deletion decreases the domination number. In A note on the domination dot-critical graphs, Discrete Appl. Math. 157 (2009) 3743-3745, Chen and Shiu constructed for each even integer k ≥ 4 infinitely many k-dot-critical graphs G with no critical vertices and k(G) = 1. In this...