论文信息 - Uniformly finite-to-one and onto extensions of homomorphisms between strongly connected graphs

Uniformly finite-to-one and onto extensions of homomorphisms between strongly connected graphs

For a homomorphism between directed graphs G"1 and G"2, its extension is the mapping of the set of all paths in G"1 into the set of all paths in G"2 obtained by naturally extending it. We investigate the properties of uniformly finite-to-one and onto extensions of homomorphisms of directed graphs, essentially the properties of uniformly finite-to-one and onto extensions of homomorphisms between strongly connected directed graphs. We also describe applications of our results on homomorphisms of directed graphs to the theory of a class of symbolic flows called subshifts of finite type.

Masakazu Nasu

[1] Claude Berge,et al. Graphs and Hypergraphs , 2021, Clustering.

[2] E. F. Moore. Machine Models of Self-Reproduction , 1962 .

[3] M. Shubik,et al. Convex structures and economic theory , 1968 .

[4] R. F. Williams. Errata to "Classification of Subshifts of Finite Type" , 1974 .

[5] Masakazu Nasu,et al. An interconnection of local maps inducing onto global maps , 1980, Discret. Appl. Math..

[6] R. F. Williams. Classification of subshifts of finite type , 1973 .

[7] Masayuki Kimura,et al. Condition for Injectivity of Global Maps for Tessellation Automata , 1976, Inf. Control..

[8] Brian Marcus,et al. Topological entropy and equivalence of dynamical systems , 1979 .

[9] J. Myhill. The converse of Moore’s Garden-of-Eden theorem , 1963 .

[10] Frank Harary,et al. Graph Theory , 2016 .

[11] G. A. Dirac,et al. Moderne Algebra. I , 1951 .

[12] F. R. Gantmakher. The Theory of Matrices , 1984 .