Related papers: Medial symmetry type graphs
A $k$-graph $\mathcal{G}$ is asymmetric if there does not exist an automorphism on $\mathcal{G}$ other than the identity, and $\mathcal{G}$ is called minimal asymmetric if it is asymmetric but every non-trivial induced sub-hypergraph of…
In a graph $G$, a subset of vertices $S \subseteq V(G)$ is said to be cyclable if there is a cycle containing the vertices in some order. $G$ is said to be $k$-cyclable if any subset of $k \geq 2$ vertices is cyclable. If any $k$…
A maniplex of rank n s an n-valent properly edge-coloured graph that generalises, simultaneously, maps on surfaces and abstract polytopes. The problem of stability in maniplexes is a natural variant of the problem of stability in graphs. A…
Consider an analytic map of a neighborhood of 0 in a vector space to a Euclidean space. Suppose that this map takes all germs of lines passing through 0 to germs of circles. Such a map is called rounding. We introduce a natural equivalence…
A generic smooth map of a closed $2k$-manifold into $(3k-1)$-space has a finite number of cusps ($\Sigma^{1,1}$-singularities). We determine the possible numbers of cusps of such maps. A fold map is a map with singular set consisting of…
Finding the k-medianin a network involves identifying a subset of k vertices that minimize the total distance to all other vertices in a graph. This problem has been extensively studied in computer science, graph theory, operations…
Abstract polytopes are combinatorial structures with distinctive geometric, algebraic, or topological characteristics, that generalize (the face lattice of) traditional polyhedra, polytopes or tessellations. Most research has focused on…
Mixed graphs can be seen as digraphs with arcs and edges (or digons, that is, two opposite arcs). In this paper, we consider the case where such graphs are bipartite and in which the undirected and directed degrees are one. The best graphs,…
In a graph whose vertices are assigned integer ranks, a path is well-ranked if the endpoints have distinct ranks or some interior point has a higher rank than the endpoints. A ranking is an assignment of ranks such that all nontrivial paths…
Motivated by relating the representation theory of the split real and $p$-adic forms of a connected reductive algebraic group $G$, we describe a subset of $2^r$ orbits on the complex flag variety for a certain symmetric subgroup. (Here $r$…
We study orbit closures and stationary measures for groups of automorphisms of $p$-adic affine surfaces.
We study graphs coming from quadratic spaces over finite fields via orthogonality which generalize a recent result given by Bishnoi, Ihringer, and Pepe (2019). More precisely, we study the graph $\Gamma^{\square}(n,k,q)$ as follows: the…
Automorphic loops are loops in which all inner mappings are automorphisms. This variety of loops includes groups and commutative Moufang loops. A half-isomorphism $f : G \longrightarrow K$ between multiplicative systems $G$ and $K$ is a…
This paper deals with finite cubic ($3$-regular) graphs whose automorphism group acts transitively on the edges of the graph. Such graphs split into two broad classes, namely arc-transitive and semisymmetric cubic graphs, and then these…
Let $G$ be a graph of order $n$ and let $k\in \{1,2,\ldots,n-1\}$. The $k$-token graph of $G$ is the graph, whose vertices are all the $k$-subsets of vertices of $G$, where two such $k$-sets are adjacent whenever their symmetric difference…
A graph is beyond-planar if it can be drawn in the plane with a specific restriction on crossings. Several types of beyond-planar graphs have been investigated, such as k-planar if every edge is crossed at most k times and RAC if edges can…
Map vertices of a graph to (not necessarily distinct) points of the plane so that two adjacent vertices are mapped at least a unit distance apart. The plane-width of a graph is the minimum diameter of the image of the vertex set over all…
Fold maps are smooth maps at each singular point of which it is represented as the product map of a Morse function and the identity map. Round fold maps are, in short, such maps the sets of all singular points of which are embedded…
Inspired by work of Fr\"oberg (1990), and Eagon and Reiner (1998), we define the \emph{total $k$-cut complex} of a graph $G$ to be the simplicial complex whose facets are the complements of independent sets of size $k$ in $G$. We study the…
This paper introduces the notion of second minimal $n$-periodic orbit of the continuous map on the interval according as if $n$ is a successor of the minimal period of the map in Sharkovski ordering. We pursue classification of second…