Related papers: $q$-Analogs of strongly regular graphs
Necessary and sufficient conditions for the exactness (in the algebraic sense) of certain sequences of continuous group homomorphisms are established.
We extend the concept of the law of a finite graph to graphings, which are, in general, infinite graphs whose vertices are equipped with the structure of a probability space. By doing this, we obtain a vast array of new unimodular measures.…
We prove orthogonality relations for some analogs of trigonometric functions on a $q$-quadratic grid and introduce the corresponding $q$-Fourier series. We also discuss several other properties of this basic trigonometric system and the…
The main purpose of thispaper is to show that composite quantum-like (QL) systems can closely mimic the separable states of quantum systems, and that suitable physical systems exhibiting these states exist. It is shown that QL graphs can…
The parametric geometry of numbers has allowed to visualize the simultaneous approximation properties of a collection of real numbers through the combined graph of the related successive minima functions. Several inequalities among…
In this paper, we give a new lifting construction of "hyperbolic" type of strongly regular Cayley graphs. Also we give new constructions of strongly regular Cayley graphs over the additive groups of finite fields based on partitions of…
In this paper, we give a construction of strongly regular Cayley graphs on the additive groups of finite fields based on three-valued Gauss periods. As consequences, we obtain two infinite families and one sporadic example of new strongly…
In this note we revisit a "ring of graphs" Q in which the set of finite simple graphs N extend the role of the natural numbers and the signed graphs Z extend the role of the integers. We point out the existence of a norm which allows to…
In the present paper, complete designs of graphs are considered. The notion of (regular) sampling is introduced and analyzed in detail, showing that the trivial necessary condition for its existence is actually sufficient. Some examples are…
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…
Several recent works have identified patterns that must exist in dense subsets of either the vertices or the edges of a large hypercube. We introduce a framework, based on the concept of series-parallel graphs, that unifies and generalizes…
We define and study q-delta-matroids, and q-g-matroids. These objects are analogues, for finite-dimensional vector spaces over finite fields, of delta-matroids and g-matroids arising from finite sets. We compare axiomatic descriptions with…
Any directed graph G with N vertices and J edges has an associated line-graph L(G) where the J edges form the vertices of L(G). We show that the non-zero eigenvalues of the adjacency matrices are the same for all graphs of such a family…
An absolute continuity approach to quasinormality which relates the operator in question to the spectral measure of its modulus is developed. Algebraic characterizations of some classes of operators that emerged in this context are…
In this paper, we establish a q-analog of partial fraction decomposition formula. By using formula, we develop new closed form representations of sums of q-harmonic numbers and reciprocal q-binomial coefficients. Moreover, we give explicit…
This paper is devoted to the study of metric subregularity and strong subregularity of any positive order $q$ for set-valued mappings in finite and infinite dimensions. While these notions have been studied and applied earlier for $q=1$…
This paper was inspired by a paper by Blokhuis and Brouwer [Designs, Codes and Cryptography 65, 2012] in which a definition of a graph on the flags of a biplane is given, and they prove that the graph corresponding to the unique…
We construct the q-analogue of Euler-Barnes' numbers and polynomials, and investigate their some properties.
For $q\in\mathbb{R}$, the $Q$-matrix $Q=Q_q$ of a connected simple graph $G=(V,E)$ is $Q_q=(q^{\partial(x,y)})_{x,y\in V}$, where $\partial$ denotes the path-length distance. Describing the set $\pi(G)$ consisting of those $q\in \mathbb{R}$…
In this paper we examine some natural ideal conditions and show how graphs can be defined that give a visualization of these conditions. We examine the interplay between the multiplicative ideal theory and the graph theoretic structure of…