Graph labelings and continuous factors of dynamical systems
The electronic journal of combinatorics, Tome 20 (2013) no. 1
A labeling of a graph is a function from the vertex set of the graph to some finite set. Certain dynamical systems (such as topological Markov shifts) can be defined by directed graphs. In these instances, a labeling of the graph defines a continuous, shift-commuting factor of the dynamical system. We find sufficient conditions on the labeling to imply classification results for the factor dynamical system. We define the topological entropy of a (directed or undirected) graph and its labelings in a way that is analogous to the definition of topological entropy for a shift space in symbolic dynamics. We show, for example, if $G$ is a perfect graph, all proper $\chi(G)$-colorings of $G$ have the same entropy, where $\chi(G)$ is the chromatic number of $G$.
DOI :
10.37236/2213
Classification :
05C78, 05C15, 37A35, 37B40
Mots-clés : distinguishing labeling, entropy, finitary isomorphism, graph coloring, graph entropy, topological entropy
Mots-clés : distinguishing labeling, entropy, finitary isomorphism, graph coloring, graph entropy, topological entropy
Affiliations des auteurs :
Stephen M. Shea  1
@article{10_37236_2213,
author = {Stephen M. Shea},
title = {Graph labelings and continuous factors of dynamical systems},
journal = {The electronic journal of combinatorics},
year = {2013},
volume = {20},
number = {1},
doi = {10.37236/2213},
zbl = {1266.05143},
url = {http://geodesic.mathdoc.fr/articles/10.37236/2213/}
}
Stephen M. Shea. Graph labelings and continuous factors of dynamical systems. The electronic journal of combinatorics, Tome 20 (2013) no. 1. doi: 10.37236/2213
Cité par Sources :