Related papers: $q$-Analogs of strongly regular graphs
The strong fractional choice number of a graph $G$ is the infimum of those real numbers $r$ such that $G$ is $(\lceil rm \rceil, m)$-choosable for every positive integer $m$. The strong fractional choice number of a family ${\cal G}$ of…
A well known class of objects in combinatorial design theory are {group divisible designs}. Here, we introduce the $q$-analogs of group divisible designs. It turns out that there are interesting connections to scattered subspaces,…
Let $\mathbb{F}_q$ be a finite field with $q$ elements and let $n$ be a positive integer. In this paper, we study the digraph associated to the map $x\mapsto x^n h(x^{\frac{q-1}{m}})$, where $h(x)\in\mathbb{F}_q[x].$ We completely determine…
We introduce four q-analogs of the double Laplace transform and prove some of their main properties. Next we show how they can be used to solve some q-functional equations and partial q-differential equations.
Traditional graph analysis focuses on nodes and edges, that is, pairwise relationships. Yet many real-world networks, including biological, social, and communication networks, involve higher-order relationships in which multiple nodes…
Calculi of string diagrams are increasingly used to present the syntax and algebraic structure of various families of circuits, including signal flow graphs, electrical circuits and quantum processes. In many such approaches, the semantic…
We have introduced q-analogues of bounded symmetric domains in our work q-alg/9703005. Given the simplest ones among those, the works q-alg/9603012 and math.QA/9803110 announce the relations describing the algebras of functions,…
We investigate quantum graphs with infinitely many vertices and edges without the common restriction on the geometry of the underlying metric graph that there is a positive lower bound on the lengths of its edges. Our central result is a…
For a finite group $G$, we introduce a generalization of norm relations in the group algebra $\mathbb Q[G]$. We give necessary and sufficient criteria for the existence of such relations and apply them to obtain relations between the…
We give simple arithmetic conditions that force the Sylow $p$-subgroup of the critical group of a strongly regular graph to take a specific form. These conditions depend only on the parameters $(v, k, \lambda, \mu)$ of the strongly regular…
We study path rings, Cohn path rings, and Leavitt path rings associated to directed graphs, with coefficients in an arbitrary ring $R$. For each of these types of rings, we stipulate conditions on the graph that are necessary and sufficient…
We propose a classification of polyhedra (planar, $3$-connected graphs) according to their type i.e., their set of quantities of common neighbours for each pair of distinct vertices. For every (finite) set of non-negative integers, we…
We study generalized quasirandom graphs whose vertex set consists of $q$ parts (of not necessarily the same sizes) with edges within each part and between each pair of parts distributed quasirandomly; such graphs correspond to the…
We investigate straight-line drawings of topological graphs that consist of a planar graph plus one edge, also called almost-planar graphs. We present a characterization of such graphs that admit a straight-line drawing. The…
In this note we give a survey about polynomials whose moments are multiples of super Catalan numbers and explore two different kinds of q-analogues.
Calculi of string diagrams are increasingly used to present the syntax and algebraic structure of various families of circuits, including signal flow graphs, electrical circuits and quantum processes. In many such approaches, the semantic…
For an $n \times n$ matrix $A$, let $q(A)$ be the number of distinct eigenvalues of $A$. If $G$ is a connected graph on $n$ vertices, let $\mathcal{S}(G)$ be the set of all real symmetric $n \times n$ matrices $A=[a_{ij}]$ such that for…
There is a type of distance-regular graph, said to be $Q$-polynomial. In this paper we investigate a generalized $Q$-polynomial property involving a graph that is not necessarily distance-regular. We give a detailed description of an…
In this work, the q-analogue of Bernoulli inequality is proved. Some other related results are presented.
A strong blocking set in a finite projective space is a set of points that intersects each hyperplane in a spanning set. We provide a new graph theoretic construction of such sets: combining constant-degree expanders with asymptotically…