Related papers: Interaction graphs of isomorphic automata networks…

The dominating graph of a graph G is a graph whose vertices correspond to the dominating sets of G and two vertices are adjacent whenever their corresponding dominating sets differ in exactly one vertex. Studying properties of dominating…

In the real world a graph is often fragmented and distributed across different sites. This highlights the need for evaluating queries on distributed graphs. This paper proposes distributed evaluation algorithms for three classes of queries:…

It is well known that when $f(v)$ is a constant for each vertex $v$, the connected $f$-factor problem is NP-Complete. In this note we consider the case when $f(v) \geq \lceil \frac{n}{2.5}\rceil$ for each vertex $v$, where $n$ is the number…

Given a network represented by a graph $G=(V,E)$, we consider a dynamical process of influence diffusion in $G$ that evolves as follows: Initially only the nodes of a given $S\subseteq V$ are influenced; subsequently, at each round, the set…

These are some informal remarks on quadratic orbital networks over finite fields. We discuss connectivity, Euler characteristic, number of cliques, planarity, diameter and inductive dimension. We find a non-trivial disconnected graph for…

We investigate graphs that can be disconnected into small components by removing a vanishingly small fraction of their vertices. We show that when a quantum network is described by such a graph, the network is efficiently controllable, in…

We study Ising spin models on finitely connected random interaction graphs which are drawn from an ensemble in which not only the degree distribution $p(k)$ can be chosen arbitrarily, but which allows for further fine-tuning of the topology…

Cycle prefix digraphs have been proposed as an efficient model of symmetric interconnection networks for parallel architecture. It has been discovered that the cycle prefix networks have many attractive communication properties. In this…

Complex networks have recently attracted much attention in diverse areas of science and technology. Many networks such as the WWW and biological networks are known to display spatial heterogeneity which can be characterized by their fractal…

In this paper, we present the benefits of exploring different topologies with equal connectivity measure, or iso-connectivity topologies, in relation to the multiagent system dynamics. The level of global information sharing ability among…

Let $k\ge 3$ be an integer, $q$ be a prime power, and $\mathbb{F}_q$ denote the field of $q$ elements. Let $f_i, g_i\in\mathbb{F}_q[X]$, $3\le i\le k$, such that $g_i(-X) = -\, g_i(X)$. We define a graph $S(k,q) =…

Let $\mathbb{F}_q$ be a finite field of odd characteristic and $2\nu+\delta\geq2$ an integer number with $\delta=0,1$ or $2$. The orthogonal inner product graph $Oi\big(2\nu+\delta,q\big)$ over $\mathbb{F}_q$ is defined and the automorphism…

The results obtained in this paper grew from an attempt to generalize the main theorem of [1]. There it was shown that any circuit injection (a 1-1 onto edge map f such that if C is a circuit then f(C) is a circuit) from a 3-connected, not…

Let $P$ be a set of $n \geq 5$ points in convex position in the plane. The path graph $G(P)$ of $P$ is an abstract graph whose vertices are non-crossing spanning paths of $P$, such that two paths are adjacent if one can be obtained from the…

We introduce Quantum Graph Neural Networks (QGNN), a new class of quantum neural network ansatze which are tailored to represent quantum processes which have a graph structure, and are particularly suitable to be executed on distributed…

In this paper we give a new generalization of token graphs. Given two integers $1\leq m \leq k$ and a graph $G$ we define the generalized token graph of the graph $G$, to be the graph $F_k^m(G)$ whose vertices correspond to configurations…

Quantum general relativity may be considered as generally covariant QFT on differentiable manifolds, without any a priori metric structure. The kinematically covariance group acts by general diffeomorphisms on the manifold and by…

Building upon [1], this study aims to introduce fractal geometry into graph theory, and to establish a potential theoretical foundation for complex networks. Specifically, we employ the method of substitution to create and explore…

Given a finite directed graph, a coloring of its edges turns the graph into a finite-state automaton. A k-synchronizing word of a deterministic automaton is a word in the alphabet of colors at its edges that maps the state set of the…

A class of graphs is $\chi$-bounded if there exists a function $f:\mathbb N\rightarrow \mathbb N$ such that for every graph $G$ in the class and an induced subgraph $H$ of $G$, if $H$ has no clique of size $q+1$, then the chromatic number…