Related papers: The graphs of non-degenerate linear codes

By a map we mean a $2$-cell decomposition of a closed compact surface, i.e., an embedding of a graph such that every face is homeomorphic to an open disc. Automorphism of a map can be thought of as a permutation of the vertices which…

A graph is 2-degenerate if every subgraph contains a vertex of degree at most 2. We show that every 2-degenerate graph can be drawn with straight lines such that the drawing decomposes into 4 plane forests. Therefore, the geometric…

The $k$-dimensional Weisfeiler-Leman algorithm ($k$-WL) is a very useful combinatorial tool in graph isomorphism testing. We address the applicability of $k$-WL to recognition of graph properties. Let $G$ be an input graph with $n$…

A graph $G$ is said to be {\em hom-idempotent} if there is a homomorphism from $G^2$ to $G$, and {\em weakly hom-idempotent} if for some $n \geq 1$ there is a homomorphism from $G^{n+1}$ to $G^n$. Larose et al. [{\em Eur. J. Comb.…

We give a method of generating strongly polynomial sequences of graphs, i.e., sequences $(H_{\mathbf{k}})$ indexed by a multivariate parameter $\mathbf{k}=(k_1,\ldots, k_h)$ such that, for each fixed graph $G$, there is a multivariate…

Let $q$ be an odd prime power, let $n\ge 2$, and let $V\subsetneq \mathbb F_{q^n}$ be a proper $\mathbb F_q$-vector subspace. Given a nonzero quadratic form $Q(X,Y)\in \mathbb F_{q^n}[X,Y]$, we consider the graph $\Gamma(Q,V)$ that…

Let $k$, $\lambda$ and $\mu$ be positive integers. A decomposition of a multigraph $ \lambda G$ into edge-disjoint subgraphs $G_1, \ldots , G_k$ is said to be \emph{enclosed} by a decomposition of a multigraph $\mu H$ into edge-disjoint…

We describe a technique to determine the automorphism group of a geometrically represented graph, by understanding the structure of the induced action on all geometric representations. Using this, we characterize automorphism groups of…

Unigraphs are graphs uniquely determined by their own degree sequence up to isomorphism. There are many subclasses of unigraphs such as threshold graphs, split matrogenic graphs, matroidal graphs, and matrogenic graphs. Unigraphs and these…

Suppose that R is an ordered ring, G_n(R) is a subsemigroup of $GL_n(R)$, consisting of all matrices with nonnegative elements. A.V. Mikhalev and M.A. Shatalova described all automorphisms of G_n(R), where R is a linearly ordered skewfield…

We follow up on previous work which found that commonly used graph evolution moves lead to conserved quantities that can be expressed in terms of the braiding of the graph in its embedding space. We study non-embedded graphs under three…

This paper deals with the problem of detecting non-isotropic high-dimensional geometric structure in random graphs. Namely, we study a model of a random geometric graph in which vertices correspond to points generated randomly and…

We provide three infinite families of graphs in the Johnson and Grassmann schemes that are not uniquely determined by their spectrum. We do so by constructing graphs that are cospectral but non-isomorphic to these graphs.

A retract of a graph $\Gamma$ is an induced subgraph $\Psi$ of $\Gamma$ such that there exists a homomorphism from $\Gamma$ to $\Psi$ whose restriction to $\Psi$ is the identity map. A graph is a core if it has no nontrivial retracts. In…

Let $k$ be a field of characteristic zero, and let $f: k[x,y] \to k[x,y]$, $f: (x,y) \mapsto (p,q)$, be a $k$-algebra endomorphism having an invertible Jacobian. Write $p=a_ny^n+\cdots+a_1y+a_0$, where $n=deg_y(p) \in \mathbb{N}$, $a_i \in…

We classify all the $2$-arc-transitive strongly regular graphs, and use this classification to study the family of finite $(G,3)$-geodesic-transitive graphs of girth $4$ or $5$ for some group $G$ of automorphisms. For this application we…

Let $n$, $k$ and $l$ be integers with $1\leq k<l\leq n-1$. The set-inclusion graph $G(n,k,l)$ is the graph whose vertex set consists of all $k$- and $l$-subsets of $[n]=\{1,2,\ldots,n\}$, where two distinct vertices are adjacent if one of…

We study the automorphism group of the algebra $\oqmn$ of $n \times n$ generic quantum matrices. We provide evidence for our conjecture that this group is generated by the transposition and the subgroup of those automorphisms acting on the…

We study linear projections on Pluecker space whose restriction to the Grassmannian is a non-trivial branched cover. When an automorphism of the Grassmannian preserves the fibers, we show that the Grassmannian is necessarily of…

In this paper, we deal with a generalization $\Gamma(\Omega,q)$ of the bipartite graphs $D(k,q)$ proposed by Lazebnik and Ustimenko, where $\Omega$ is a set of binary sequences that are adopted to index the entries of the vertices. A few…