Related papers: Two bounds on the noncommuting graph
The non--commuting graph $\Gamma(G)$ of a non--abelian group $G$ is defined as follows. The vertex set $V(\Gamma(G))$ of $\Gamma(G)$ is $G\setminus Z(G)$ where $Z(G)$ denotes the center of $G$ and two vertices $x$ and $y$ are adjacent if…
The Seiberg--Witten map is a powerful tool in non-commutative field theory, and it has been recently obtained in the literature for gravity itself, to first order in non-commutativity. This paper, relying upon the pure-gravity form of the…
We define the magnetic Schr\"odinger on an infinite graph by the data of a magnetic field, some weights on vertices and some weights on edges . We discuss essential self-adjointness of this operator for graphs of bounded degree. The main…
In recent years, many new developments in theoretical physics, and in practical applications rely on different techniques of noncommutative algebras. In this review, we introduce the basic concepts and techniques of noncommutative physics…
Graph symmetries intervene in diverse applications, from enumeration, to graph structure compression, to the discovery of graph dynamics (e.g., node arrival order inference). Whereas Erd\H{o}s-R\'enyi graphs are typically asymmetric, real…
Lettericity is a graph parameter introduced by Petkov\v{s}ek in 2002 in order to study well-quasi-orderability under the induced subgraph relation. In the world of permutations, geometric griddability was independently introduced in 2013 by…
Graphical models have been popularly used for capturing conditional independence structure in multivariate data, which are often built upon independent and identically distributed observations, limiting their applicability to complex…
We study the number of connected graphs with $n$ vertices that cannot be written as the cartesian product of two graphs with fewer vertices. We give an upper bound which implies that for large $n$ almost all graphs are both connected and…
Let $G$ be a finite group. For a fixed element $g$ in $G$ and a given subgroup $H$ of $G$, the relative $g$-noncommuting graph of $G$ is a simple undirected graph whose vertex set is $G$ and two vertices $x$ and $y$ are adjacent if $x \in…
In the context of integrable partial difference equations on quad-graphs, we introduce the notion of open boundary reductions as a new means to construct discrete integrable mappings and their invariants. This represents an alternative to…
In this paper, we investigate the eigenvalues of the Laplacian matrix of the "graph of graphs", in which cubic graphs of order n are joined together using Whitehead moves. Our work follows recent results from arXiv:2303.13923 , which…
We consider weighted graphs with an infinite set of vertices. We show that boundedness of all functions of finite energy can be seen as a notion of `relative compactness' for such graphs and study sufficient and necessary conditions for…
We present a new notion of limits of weighted directed graphs of growing size based on convergence of their random quotients. These limits are specified in terms of random exchangeable measures on the unit square. We call our limits…
A non-zero component graph $G(\mathbb{V})$ associated to a finite vector space $\mathbb{V}$ is a graph whose vertices are non-zero vectors of $\mathbb{V}$ and two vertices are adjacent, if their corresponding vectors have at least one…
We expand on some invariants used for classifying nonselfadjoint operator algebras. Specifically to nonselfadjoint operator algebras which have a conditional expectation onto a commutative diagonal we construct an edge-colored directed…
We present recent advances in harmonic analysis on infinite graphs. Our approach combines combinatorial tools with new results from the theory of unbounded Hermitian operators in Hilbert space, geometry, boundary constructions, and spectral…
We give a unified approach to analysing, for each positive integer $s$, a class of finite connected graphs that contains all the distance transitive graphs as well as the locally $s$-arc transitive graphs of diameter at least $s$. A graph…
We show that if a non-amenable, quasi-transitive, unimodular graph $G$ has all degrees even then it has a factor-of-iid balanced orientation, meaning each vertex has equal in- and outdegree. This result involves extending earlier…
Nonlinear dynamics on graphs has rapidly become a topical issue with many physical applications, ranging from nonlinear optics to Bose-Einstein condensation. Whenever in a physical experiment a ramified structure is involved, it can prove…
We confirm the eventual evasiveness of several classes of monotone graph properties under widely accepted number theoretic hypotheses. In particular we show that Chowla's conjecture on Dirichlet primes implies that (a) for any graph $H$,…