Related papers: The graphs of non-degenerate linear codes

These notes concern aspects of various graphs whose vertex set is a group $G$ and whose edges reflect group structure in some way (so that they are invariant under the action of the automorphism group of $G$). The graphs I will discuss are…

A mixed graph is a set of vertices together with an edge set and an arc set. An $(m,n)$-mixed graph $G$ is a mixed graph whose edges are each assigned one of $m$ colours, and whose arcs are each assigned one of $n$ colours. A \emph{switch}…

The canonical double cover $\D(\Gamma)$ of a graph $\Gamma$ is the direct product of $\Gamma$ and $K_2$. If $\Aut(\D(\Gamma))\cong\Aut(\Gamma)\times\ZZ_2$ then $\Gamma$ is called stable; otherwise $\Gamma$ is called unstable. An unstable…

In this paper an example of a $k$-independent $(n,k)$-type GKM-graph without nontrivial extensions is constructed for any $n\geq k\geq 3$. It is shown that this example cannot be realized by a GKM-manifold for any $n=k=3$ or $n\geq k\geq…

If $F$ is a polynomial automorphism over a finite field $\F_q$ in dimension $n$, then it induces a bijection $\pi_{q^r}(F)$ of $(\F_{q^r})^n$ for every $r\in \N^*$. We say that $F$ can be `mimicked' by elements of a certain group of…

A graph is $k$-degenerate if every subgraph $H$ has a vertex $v$ with $d_{H}(v) \leq k$. The class of degenerate graphs plays an important role in the graph coloring theory. Observed that every $k$-degenerate graph is $(k + 1)$-choosable…

Comparability graphs are graphs which have transitive orientations. The dimension of a poset is the least number of linear orders whose intersection gives this poset. The dimension ${\rm dim}(X)$ of a comparability graph $X$ is the…

In this article, we will show that the automorphism group of any hypergraph is essentially equal to the determinant of some matrix over a ring generated from the set of ground points. With this, we are also able to determine whether two…

Let $G = (V, E)$ be a connected graph with maximum degree $k\geq 3$ distinct from $K_{k+1}$. Given integers $s \geq 2$ and $p_1,\ldots,p_s\geq 0$, $G$ is said to be $(p_1, \dots, p_s)$-partitionable if there exists a partition of $V$ into…

Let $\textrm{UT}_n (K)$ be a unitriangular group over a field $K$ and $\Gamma_{n,k} := \textrm{UT}_n (K)/ \gamma_k(\textrm{UT}_n (K))$, where $\gamma_k (\mathrm{UT}_n(K))$ denotes the $k$-th term of the lower central series of…

The Grassmannians of lines in projective N-space, G(1,N), are embedded by way of the Pl"ucker embedding in the projective space P(\bigwedge^2 C^{N+1}). Let H^l be a general l-codimensional linear subspace in this projective space. We…

Let F* be the field of q elements and let P(n,q) denote the projective space of dimension n-1 over F*. We construct a family H^{n}_{k,i} of combinatorial homology modules associated to P(n,q) for a coefficient field F of positive…

We establish that every embedding of a Grassmann graph in a polar Grassmann graph can be reduced to an embedding in a Grassmann graph or to an embedding in the collinearity graph of a polar space. Also, we consider $3$-embeddings, i.e.…

We prove that, if $\Gamma$ is a finite connected cubic vertex-transitive graph, then either there exists a semiregular automorphism of $\Gamma$ of order at least $6$, or the number of vertices of $\Gamma$ is bounded above by an absolute…

A $k$-polar Grassmannian is the geometry having as pointset the set of all $k$-dimensional subspaces of a vector space $V$ which are totally isotropic for a given non-degenerate bilinear form $\mu$ defined on $V.$ Hence it can be regarded…

We study certain extensions of the Adler map on Grassmann algebras $\Gamma(n)$ of order $n$. We consider a known Grassmann-extended Adler map, and assuming that $n=1$ we obtain a commutative extension of Adler's map in six dimensions. We…

A graph is $k$-planar if it can be drawn in the plane such that no edge is crossed more than $k$ times. While for $k=1$, optimal $1$-planar graphs, i.e., those with $n$ vertices and exactly $4n-8$ edges, have been completely characterized,…

We study the complexity of the Graph Isomorphism problem on graph classes that are characterized by a finite number of forbidden induced subgraphs, focusing mostly on the case of two forbidden subgraphs. We show hardness results and develop…

Let $G$ be a graph of minimum degree at least two with no induced subgraph isomorphic to $K_{1,6}$. We prove that if $G$ is not isomorphic to one of eight exceptional graphs, then it is possible to assign two-element subsets of…

We show that extending an embedding of a graph $\Gamma$ in a surface to an embedding of a Hamiltonian supergraph can be blocked by certain planar subgraphs but, for some subdivisions of $\Gamma$, Hamiltonian extensions must exist.