Related papers: Genericity of chaos for colored graphs
Vertex coloring of a graph $G$ with $n$-colors can be equivalently thought to be a graph homomorphism (edge preserving vertex mapping) of $G$ to the complete graph $K_n$ of order $n$. So, in that sense, the chromatic number $\chi(G)$ of $G$…
A new approach is proposed to the analysis of generalized synchronization of multidimensional chaotic systems. The approach is based on the symbolic analysis of discrete sequences in the basis of a finite T-alphabet. In fact, the symbols of…
Chromatic polynomials and related graph invariants are central objects in both graph theory and statistical physics. Computational difficulties, however, have so far restricted studies of such polynomials to graphs that were either very…
Erd\H{o}s proved that there are graphs with arbitrarily large girth and chromatic number. We study the extension of this for generalized chromatic numbers.
Transitions to chaos in archetypal low-dimensional nonlinear maps offer real and precise model systems in which to assess proposed generalizations of statistical mechanics. The known association of chaotic dynamics with the structure of…
The abstract hyperbolic sets are introduced. Continuous and differentiable mappings as well as rate of convergence and transversal manifolds are not under discussion, and the symbolic dynamics paradigm is realized in a new way. Our…
A total dominator coloring of a graph G is a proper coloring of G in which each vertex of the graph is adjacent to every vertex of some color class. The total dominator chromatic number of a graph is the minimum number of color classes in a…
Spatio-temporally chaotic dynamics of a classical field can be described by means of an infinite hierarchy of its unstable spatio-temporally periodic solutions. The periodic orbit theory yields the global averages characterizing the chaotic…
Lattice-based cryptography is not only for thwarting future quantum computers, and is also the basis of Fully Homomorphic Encryption. Motivated from the advantage of graph homomorphisms we combine graph homomorphisms with graph total…
Let $G$ be a simple graph. A total dominator coloring of $G$ is a proper coloring of the vertices of $G$ in which each vertex of the graph is adjacent to every vertex of some color class. The total dominator chromatic number $\chi_d^t(G)$…
We study countable graphs that -- up to isomorphism and with probability one -- arise from a random process, in a similar fashion as the Rado graph. Unlike in the classical case, we do not require that probabilities assigned to pairs of…
The authors present two results on infinite-dimensional linear dynamical systems with chaoticity. One is about the chaoticity of the backward shift map in the space of infinite sequences on a general Fr\'{e}chet space. The other is about…
We show that, given an infinite cardinal $\mu$, a graph has colouring number at most $\mu$ if and only if it contains neither of two types of subgraph. We also show that every graph with infinite colouring number has a well-ordering of its…
A coloring of vertices of a given graph is called perfect if the color structure of each ball of radius $1$ in the graph depends only on the color of the ball center. Let $n$ be a positive integer. We consider a lexicographic product of the…
We characterize dendrites $D$ such that a continuous selfmap of $D$ is generically chaotic (in the sense of Lasota) if and only if it is generically $\varepsilon$-chaotic for some $\varepsilon>0$. In other words, we characterize dendrites…
The fractional and circular chromatic numbers are the two most studied non-integral refinements of the chromatic number of a graph. Starting from the definition of a coloring base of a graph, which originated in work related to ergodic…
Using the definition of colouring of $2$-edge-coloured graphs derived from $2$-edge-coloured graph homomorphism, we extend the definition of chromatic polynomial to $2$-edge-coloured graphs. We find closed forms for the first three…
In order to make more complex number-based strings from topological coding for defending against the intelligent attacks equipped with quantum computing and providing effective protection technology for the age of quantum computing, we will…
A total dominator coloring of a graph $G$ is a proper coloring of $G$ in which each vertex of the graph is adjacent to every vertex of some color class. The total dominator chromatic number of a graph is the minimum number of color classes…
We investigate the extent to which the $k$-coloring graph $\mathcal{C}_{k}(G)$ uniquely determines the base graph $G$ and the number of colors $k$. The vertices of $\mathcal{C}_{k}(G)$ are the proper $k$-colorings of $G$, and edges connect…