Related papers: Nilpotent dynamics on signed interaction graphs an…

Let $G$ be a simple graph with $2n$ vertices and a perfect matching. We denote by $f(G)$ and $F(G)$ the minimum and maximum forcing number of $G$, respectively. Hetyei obtained that the maximum number of edges of graphs $G$ with a unique…

Chaotic attractors, chaotic saddles and periodic orbits are examples of chain-recurrent sets. Using arbitrary small controls, a trajectory starting from any point in a chain-recurrent set can be steered to any other in that set. The…

Given a finite group $G$, the difference graph of $G$, denoted by $\mathcal{D}(G)$, is the difference of the enhanced power graph of $G$ and the power graph of $G$, with all isolated vertices removed. This paper mainly studies the…

Let $p$ be a prime, $e$ a positive integer, $q = p^e$, and let $\mathbb{F}_q$ denote the finite field of $q$ elements. Let $f_i : \mathbb{F}_q^2\to\mathbb{F}_q$ be arbitrary functions, where $1\le i\le l$, $i$ and $l$ are integers. The…

A directed graph G (V, E) is strongly connected if and only if, for a pair of vertices X and Y from V, there exists a path from X to Y and a path from Y to X. In Computer Science, the partition of a graph in strongly connected components is…

The power graph $\mathcal P_G$ of a finite group $G$ is the graph with the vertex set $G$, where two elements are adjacent if one is a power of the other. We first show that $\mathcal P_G$ has an transitive orientation, so it is a perfect…

The power graph $\Gamma_G$ of a finite group $G$ is the graph whose vertex set is the group, two distinct elements being adjacent if one is a power of the other. In this paper, we classify the finite groups whose power graphs have…

Let f be a dominant meromorphic self-map on a compact Kaehler manifold X which preserves a fibration given by a meromorphic map from X to a compact Kaehler manifold Y. We compute the dynamical degrees of f in term of its dynamical degrees…

A graph theoretic perspective is taken for a range of phenomena in continuum physics in order to develop representations for analysis of large scale, high-fidelity solutions to these problems. Of interest are phenomena described by partial…

While a number of bounds are known on the zero forcing number $Z(G)$ of a graph $G$ expressed in terms of the order of a graph and maximum or minimum degree, we present two bounds that are related to the (upper) total domination number…

A dynamical system is a pair $(X,G)$, where $X$ is a compact metrizable space and $G$ is a countable group acting by homeomorphisms of $X$. An endomorphism of $(X,G)$ is a continuous selfmap of $X$ which commutes with the action of $G$. One…

Let $G$ be a graph and $A$ be its adjacency matrix. A graph $G$ is invertible if its adjacency matrix $A$ is invertible and the inverse of $G$ is a weighted graph with adjacency matrix $A^{-1}$. A signed graph $(G,\sigma)$ is a weighted…

For a finite group $G,$ we investigate the direct graph $\Gamma(G),$ whose vertices are the non-hypercentral elements of $G$ and where there is an edge $x\mapsto y$ if and only if $[x,_ny]=1$ for some $n \in \mathbb N.$ We prove that…

Let $f:X\to X $ be a dominant self-morphism of an algebraic variety over an algebraically closed field of characteristic zero. We consider the set $\Sigma_{f^{\infty}}$ of $f$-periodic (irreducible closed) subvarieties of small dynamical…

Graph Neural Networks (GNNs) have established themselves as a key component in addressing diverse graph-based tasks. Despite their notable successes, GNNs remain susceptible to input perturbations in the form of adversarial attacks. This…

Functional dynamics, introduced in a previous paper, is analyzed, focusing on the formation of a hierarchical rule to determine the dynamics of the functional value. To study the periodic (or non-fixed) solution, the functional dynamics is…

Let $K$ be a finite extension of the field $\mathbb{Q}_p$ of $p$-adic numbers and $\O$ be its integral ring. The convergent power series with coefficients in $\O$ are studied as dynamical systems on $\O$. A minimal decomposition theorem for…

The commutative semiring $\mathbf{D}$ of finite, discrete-time dynamical systems was introduced in order to study their (de)composition from an algebraic point of view. However, many decision problems related to solving polynomial equations…

We study a mathematical model of biological neuronal networks composed by any finite number $N \geq 2$ of non necessarily identical cells. The model is a deterministic dynamical system governed by finite-dimensional impulsive differential…

In this paper, we study abstract dynamical systems with discrete phase spaces. One example of such a system is induced by the $3 x{+}1$-map on the set of all natural numbers, also known as the Collatz map. Our main focus is on dynamical…