Related papers: Classification of edge-transitive propeller graphs

The graph complexity of a compact 3-manifold is defined as the minimum order among all 4-colored graphs representing it. Exact calculations of graph complexity have been already performed, through tabulations, for closed orientable…

The motion of a graph is the minimum number of vertices that are moved by a non-trivial automorphism. Equivalently, it can be defined as the minimal degree of its automorphism group (as a permutation group on the vertices). In this paper we…

A graph is called 1-planar if it can be drawn in the plane so that each of its edges is crossed by at most one other edge. In this paper we decompose the set of all 1-planar graphs into three classes $\mathcal C_0, \mathcal C_1$ and…

A graph is $1$-planar, if it can be drawn in the plane such that there is at most one crossing on every edge. It is known, that $1$-planar graphs have at most $4n-8$ edges. We prove the following odd-even generalization. If a graph can be…

We classify isomorphism-invariant random digraphs according to where randomness resides, namely, arcs, vertices, and vertices and arcs together which in turn yield arc random digraphs (ARD), vertex random digraphs (VRD) and vertex-arc…

We construct an infinite family of 6-regular graphs $\{G_n\}_{n\ge 3}$ by taking $n$ copies of the Petersen graph and wiring corresponding vertices according to an $n$-cycle permutation. Each $G_n$ has $10n$ vertices, $30n$ edges, and…

In this paper we introduce Yoke graphs, a family of flip graphs that generalizes several previously studied families of graphs: colored triangle free triangulations, arc permutations and caterpillars. Our main result is the computation of…

We prove that there exist infinite families of regular bipartite Ramanujan graphs of every degree bigger than 2. We do this by proving a variant of a conjecture of Bilu and Linial about the existence of good 2-lifts of every graph. We also…

In this paper, we combine group-theoretic and combinatorial techniques to study $\wedge$-transitive digraphs admitting a cartesian decomposition of their vertex set. In particular, our approach uncovers a new family of digraphs that may be…

We introduce the notion of an \emph{$n$-dimensional mixed dihedral group}, a general class of groups for which we give a graph theoretic characterisation. In particular, if $H$ is an $n$-dimensional mixed dihedral group then the we…

A geometric graph is a graph drawn in the plane with vertices represented by points and edges as straight-line segments. A geometric graph contains a (k,l)-crossing family if there is a pair of edge subsets E_1,E_2 such that |E_1| = k and…

A total prime labeling of a graph of order $n$ is an extension of a prime labeling in which we distinctly label the vertices and edges. The goal of the labeling is for adjacent vertex labels to be relatively prime, and for each vertex of…

Let $\mathcal{E}$ be a $\mathbb{Q}$-isogeny class of elliptic curves defined over $\mathbb{Q}$. The isogeny graph associated to $\mathcal{E}$ is a graph which has a vertex for each element of $\mathcal{E}$ and an edge for each…

Recent classification of $\frac{3}{2}$-transitive permutation groups leaves us with three infinite families of groups which are neither $2$-transitive, nor Frobenius, nor one-dimensional affine. The groups of the first two families…

In this paper we further develop the theory of one sided shift spaces over infinite alphabets, characterizing one-step shifts as edge shifts of ultragraphs and partially answering a conjecture regarding shifts of finite type (we show that…

A $k$-regular graph of girth $g$ is called edge-girth-regular graph, shortly egr-graph, if each of its edges is contained in exactly $\lambda$ distinct $g-$cycles. An egr-graph is called extremal for the triple $(k, g, \lambda)$ if has the…

For an integer $s\geq1$ and a graph $\Gamma$, a path $(u_0, u_1, \ldots, u_{s})$ composed of vertices of $\Gamma$ is called an {\em $s$-geodesic} if it is a shortest path between $u_0$ and $u_s$. We say that $\Gamma$ is {\em $s$-geodesic…

A graph $G=(V,E)$ is a $k$-critical graph if $G$ is not $(k -1)$-colorable but $G-e$ is $(k-1)$-colorable for every $e\in E(G)$. In this paper, we construct a family of 4-critical planar graphs with $n$ vertices and $\frac{7n-13}{3}$ edges.…

In this paper, we identify a new family of $e$-positive graphs, called the trinacria graphs $T_{(b+2)b2}$, thereby providing a partial answer to Stanley's question on which graphs are $e$-positive. The trinacria graph $T_{abc}$ is the graph…

A graph $\Gamma$ is $G$-symmetric if $G$ is a group of automorphisms of $\Gamma$ which is transitive on the set of ordered pairs of adjacent vertices of $\Gamma$. If $V(\Gamma)$ admits a nontrivial $G$-invariant partition ${\cal B}$ such…