Related papers: Genericity of chaos for colored graphs
This paper investigates when countable graphs have a finite or an infinite chromatic number through model theoretic methods. For Fra\"{i}ss\'{e} limits, we show that instability forces the chromatic number to be infinite, yielding a…
We define the $d$-defective incidence chromatic number of a graph, generalizing the notion of incidence chromatic number, and determine it for some classes of graphs including trees, complete bipartite graphs, complete graphs, and…
We give a definition of chaos for a continuous self-map of a general topological space. This definition coincides with the Devanney definition for chaos when the topological space happens to be a metric space. We show that in a uniform…
Coloured graphical models are Gaussian statistical models determined by an undirected coloured graph. These models can be described by linear spaces of symmetric matrices. We outline a relationship between the symmetries of the graph and…
We present quantum graphs with remarkably regular spectral characteristics. We call them {\it regular quantum graphs}. Although regular quantum graphs are strongly chaotic in the classical limit, their quantum spectra are explicitly…
The harmonious chromatic number of a graph $G$ is the minimum number of colors that can be assigned to the vertices of $G$ in a proper way such that any two distinct edges have different color pairs. This paper gives various results on…
Chaotic dynamics can be quite heterogeneous in the sense that in some regions the dynamics are unstable in more directions than in other regions. When trajectories wander between these regions, the dynamics is complicated. We say a chaotic…
Fixed point iterations are known to generate chaos, for some values in their parameter range. It is an established fact that Turing Machines are fixed point iterations. However, as these Machines operate in integer space, the standard…
Chaotic functions are characterized by sensitivity to initial conditions, transitivity, and regularity. Providing new functions with such properties is a real challenge. This work shows that one can associate with any Boolean network a…
Chaotic cryptography describes the use of chaos theory (in particular physical dynamical systems working in chaotic regime as part of communication techniques and computation algorithms) to perform different cryptographic tasks in a…
In this paper we describe all edge-colored graphs that are fully symmetric with respect to colors and transitive on every set of edges of the same color. They correspond to fully symmetric homogeneous factorizations of complete graphs. Our…
The scope of this teaching package is to make a brief introduction to some notions and properties of chaotic systems. We first make a brief introduction to chaos in general and then we show some important properties of chaotic systems using…
The energy level statistics of uniform random graphs are studied, by treating the graphs as random tight-binding lattices. The inherent random geometry of the graphs and their dynamical spatial dimensionality, leads to various quantum…
A coloring is called $s$-wide if no walk of length $2s-1$ connects vertices of the same color. A graph is $s$-widely colorable with $t$ colors if and only if it admits a homomorphism into a universal graph $W(s,t)$. Tardif observed that the…
We generalize proper coloring of gain graphs to totally frustrated states, where each vertex takes a value in a set of `qualities' or `spins' that is permuted by the gain group. (An example is the Potts model.) The number of totally…
In this paper, we generalize the concept of complete coloring and achromatic number to 2-edge-colored graphs and signed graphs. We give some useful relationships between different possible definitions of such achromatic numbers and prove…
Based on newly discovered properties of the shift map (Theorem 1), we believe that chaos should involve not only nearby points can diverge apart but also faraway points can get close to each other. Therefore, we propose to call a continuous…
Graph Coloring consists in assigning colors to vertices ensuring that two adjacent vertices do not have the same color. In dynamic graphs, this notion is not well defined, as we need to decide if different colors for adjacent vertices must…
The vertices of a $k$-token graph of a graph $G$ correspond to $k$ indistinguishable tokens placed on $k$ different vertices of $G$. Changing some conditions on both the nature of the tokens and the number of tokens allowed in each vertex…
We consider (not necessarily proper) colorings of the vertices of a graph where every color is thoroughly distributed, that is, appears in every open neighborhood. Equivalently, every color is a total dominating set. We define $\td(G)$ as…