Related papers: Medial symmetry type graphs
{\em Honeycomb toroidal graphs} are a family of cubic graphs determined by a set of three parameters, that have been studied over the last three decades both by mathematicians and computer scientists. They can all be embedded on a torus and…
Symmetric $k$-varieties are a natural generalization of symmetric spaces to general fields $k$. We study the action of minimal parabolic $k$-subgroups on symmetric $k$-varieties and define a map that embeds these orbits within the orbits…
A regular map is a surface together with an embedded graph, having properties similar to those of the surface and graph of a platonic solid. We analyze regular maps with reflection symmetry and a graph of density strictly exceeding 1/2, and…
A vertex $v$ in a map $M$ has the face-sequence $(p_1 ^{n_1}. \ldots. p_k^{n_k})$, if there are $n_i$ numbers of $p_i$-gons incident at $v$ in the given cyclic order, for $1 \leq i \leq k$. A map $M$ is called a semi-equivelar map if each…
A vertex-transitive map $X$ is a map on a closed surface on which the automorphism group ${\rm Aut}(X)$ acts transitively on the set of vertices. If the face-cycles at all the vertices in a map are of same type then the map is said to be a…
Every finite, self-dual, regular (or chiral) 4-polytope of type {3,q,3} has a trivalent 3-transitive (or 2-transitive) medial layer graph. Here, by dropping self-duality, we obtain a construction for semisymmetric trivalent graphs (which…
J. Eells and L. Lemaire introduced k-harmonic maps, and Wang Shaobo showed the first variational formula. When, k=2, it is called biharmonic maps (2-harmonic maps). There have been extensive studies in the area. In this paper, we consider…
A tiling (edge-to-edge) of the plane is a family of tiles that cover the plane without gaps or overlaps. Vertex figure of a vertex in a tiling to be the union of all edges incident to that vertex. A tiling is $k$-vertex-homogeneous if any…
The deep diagonal map $T_k$ acts on planar polygons by connecting the $k$-th diagonals and intersecting them successively. The map $T_2$ is the pentagram map, and $T_k$ is a generalization. We study the action of $T_k$ on two subsets of the…
We consider a modified notion of planarity, in which two nations of a map are considered adjacent when they share any point of their boundaries (not necessarily an edge, as planarity requires). Such adjacencies define a map graph. We give…
In the field of complex networks and graph theory, new results are typically tested on graphs generated by a variety of algorithms such as the Erd\H{o}s-R\'{e}nyi model or the Barab\'{a}si-Albert model. Unfortunately, most graph generating…
A graph is edge-transitive if the natural action of its automorphism group on its edge set is transitive. An automorphism of a graph is semiregular if all of the orbits of the subgroup generated by this automorphism have the same length.…
In this paper, we introduce the concept of $k$-integral graphs. A graph $\Gamma$ is called $k$-integral if the extension degree of the splitting field of the characteristic polynomial of $\Gamma$ over rational field $\mathbb Q$ is equal to…
In this article, we study orientably-regular maps of Euler characteristic $-2p^2$ and classify those that admit a group of orientation-preserving automorphisms of order $10p^2$, where $p$ is a prime number. Along the way, we classify all…
We introduce and study the $\textit{OrthoSEFE}-k$ problem: Given $k$ planar graphs each with maximum degree 4 and the same vertex set, do they admit an OrthoSEFE, that is, is there an assignment of the vertices to grid points and of the…
A digraph is called an $n$-Cayley digraph if its automorphism group has an $n$-orbit semiregular subgroup. We determine the splitting fields of $n$-Cayley digraphs over abelian groups and compute a bound on their algebraic degrees, before…
It is well known that a plane graph is Eulerian if and only if its geometric dual is bipartite. We extend this result to partial duals of plane graphs. We then characterize all bipartite partial duals of a plane graph in terms of oriented…
The distinguishing number (index) $D(G)$ ($D'(G)$) of a graph $G$ is the least integer $d$ such that $G$ has a vertex (edge) labeling with $d$ labels that is preserved only by a trivial automorphism. In this paper we consider the maximal…
We introduce orbital graphs and discuss some of their basic properties. Then we focus on their usefulness for search algorithms for permutation groups, including finding the intersection of groups and the stabilizer of sets in a group.
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…