Discrete Morse theory on graphs

We characterize the topology of a graph in terms of the critical elements of a discrete Morse function defined on it. Besides, we study the structure and some properties of the gradient vector field induced by a discrete Morse function defined on a graph. Finally, we get results on the number of non...

Descripción completa

Detalles Bibliográficos
Autores: Ayala Gómez, Rafael, Fernández Fernández, Luis Manuel, Fernández Ternero, Desamparados, Vilches Alarcón, José Antonio
Tipo de recurso: artículo
Estado:Versión publicada
Fecha de publicación:2009
País:España
Institución:Universidad de Sevilla (US)
Repositorio:idUS. Depósito de Investigación de la Universidad de Sevilla
OAI Identifier:oai:idus.us.es:11441/183482
Acceso en línea:https://hdl.handle.net/11441/183482
https://doi.org/10.1016/j.topol.2009.01.022
Access Level:acceso abierto
Palabra clave:Infinite locally finite graph
Critical element
Gradient vector field
Gradient path
Descripción
Sumario:We characterize the topology of a graph in terms of the critical elements of a discrete Morse function defined on it. Besides, we study the structure and some properties of the gradient vector field induced by a discrete Morse function defined on a graph. Finally, we get results on the number of non-homologically equivalent excellent discrete Morse functions defined on some kind of graphs.