| Nome: | Descrição: | Tamanho: | Formato: | |
|---|---|---|---|---|
| 278.78 KB | Adobe PDF | |||
| 191.71 KB | Adobe PDF |
Autores
Orientador(es)
Resumo(s)
We define nonautonomous graphs as a class of dynamic graphs in discrete time whose time-dependence consists in connecting or disconnecting edges. We study periodic paths in these graphs, and the associated zeta functions. Based on the analytic properties of these zeta functions we obtain explicit formulae for the number of n-periodic paths, as the sum of the nth powers of some specific algebraic numbers.
Descrição
Palavras-chave
Dynamic graphs Nonautonomous graphs Periodic paths Zeta functions Nonautonomous dynamical systems Nonautonomous difference equations Interval
Contexto Educativo
Citação
ALVES, J. F.; SILVA, L. – Periodic paths on nonautonomous graphs. Linear Algebra and its Applications. ISSN: 0024-3795. Vol. 437, nr. 3 (2012), pp. 1003-1015
Editora
Elsevier