Related papers: Transitive cornerations in maps
The fine 1-curve graph of a surface is a graph whose vertices are simple closed curves on the surface and whose edges connect vertices that intersect in at most one point. We show that the automorphism group of the fine 1-curve graph is…
The contour of a family of filters along a filter is a set-theoretic lower limit. Topologicity and regularity of convergences can be characterized with the aid of the contour operation. Contour inversion is studied, in particular, for…
Every simple drawing of a graph in the plane naturally induces a rotation system, but it is easy to exhibit a rotation system that does not arise from a simple drawing in the plane. We extend this to all surfaces: for every fixed surface…
We prove that every finite arc-transitive graph of valency twice a prime admits a nontrivial semiregular automorphism, that is, a non-identity automorphism whose cycles all have the same length. This is a special case of the Polycirculant…
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…
We introduce the notion of one-sided mapping cones of positive linear maps between matrix algebras. These are convex cones of maps that are invariant under compositions by completely positive maps from either the left or right side. The…
For a continuous map on a topological graph containing a unique loop S it is possible to define the degree and, for a map of degree 1, rotation numbers. It is known that the set of rotation numbers of points in S is a compact interval and…
A map is an abstract visual representation of a region, taken from a given space, usually designed for final human consumption. Traditional cartography focuses on the mapping of Euclidean spaces by using some distance metric. In this paper…
We characterize the respective semigroups of mappings that preserve, or that preserve or reverse orientation of a finite cycle, in terms of their actions on oriented triples and oriented quadruples. This leads to a proof that the latter…
In a simple drawing of a graph, any two edges intersect in at most one point (either a common endpoint or a proper crossing). A simple drawing is generalized twisted if it fulfills certain rather specific constraints on how the edges are…
The stable and unstable manifolds of an invariant set of a piecewise-smooth map are themselves piecewise-smooth. Consequently, as parameters of a piecewise-smooth map are varied, an invariant set can develop a homoclinic connection when its…
This paper discusses a more general contractive condition for a class of extended cyclic self-mappings on the union of a finite number of subsets of a metric space which are allowed to have a finite number of successive images in the same…
The cycle space of a graph corresponds to the kernel of an incidence matrix. We investigate an analogous subspace for digraphs. In the case of digraphs of graphs, where every edge is replaced by two oppositely directed arcs, we give a…
A graph admitting an automorphism with two orbits of the same length is called a bicirculant. Recently, Jajcay et al. initiated the investigation of the edge-transitive bicirculants with the properties that one of the subgraphs induced by…
The edge betweenness centrality of an edge is loosely defined as the fraction of shortest paths between all pairs of vertices passing through that edge. In this paper, we investigate graphs where the edge betweenness centrality of edges is…
A rotor-router walk is a deterministic version of a random walk, in which the walker is routed to each of the neighbouring vertices in some fixed cyclic order. We consider here directed covers of graphs (called also periodic trees) and we…
Given two graphs, a mapping between their edge-sets is cycle-continuous, if the preimage of every cycle is a cycle. The motivation for this notion is Jaeger's conjecture that for every bridgeless graph there is a cycle-continuous mapping to…
If the face\mbox{-}cycles at all the vertices in a map are of same type then the map is called semi\mbox{-}equivelar. A tiling is edge-homogeneous if any two edges with vertices of congruent face-cycles. In general, edge-homogeneous maps on…
Unimodal (i.e. single-humped) permutations may be decomposed into a product of disjoint cycles. Some enumerative results concerning their cyclic structure -- e.g. 2/3 of them contain fixed points -- are given. We also obtain in effect a…
A geometric graph is a graph embedded in the plane with vertices at points and edges drawn as curves (which are usually straight line segments) between those points. The average transversal complexity of a geometric graph is the number of…