Related papers: Inverse monoids of partial graph automorphisms
These lecture notes provide an introduction to automorphism groups of graphs. Some special families of graphs are then discussed, especially the families of Cayley graphs generated by transposition sets.
Let $(G,w)$ be a weighted graph with a weight-function $w: E(G)\to \mathbb R\backslash\{0\}$. A weighted graph $(G,w)$ is invertible to a new weighted graph if its adjacency matrix is invertible. A graph inverse has combinatorial interest…
We describe the additive subgroups of fields which are closed with respect to taking inverses. In particular, in characteristic different from two any such subgroup is either a subfield or the kernel of the trace map of a quadratic…
An automorphism on a complex supermanifold $\mathcal M$ is called unipotent if it reduces to the identity on the associated graded supermanifold $gr(\mathcal M)$. These automorphisms are close to be complementary to those responsible for…
Every transformation monoid comes equipped with a canonical topology-the topology of pointwise convergence. For some structures, the topology of the endomorphism monoid can be reconstructed from its underlying abstract monoid. This…
We show that any isomorphism between mapping class groups of orientable infinite-type surfaces is induced by a homeomorphism between the surfaces. Our argument additionally applies to automorphisms between finite-index subgroups of these…
Inverse graph semigroups were defined by Ash and Hall in 1975. They found necessary and sufficient conditions for the semigroups to be congruence free. In this paper we give a description of congruences on a graph inverse semigroup in terms…
Two signed graphs are called switching isomorphic if one of them is isomorphic to a switching equivalent of the other. To determine the number of switching non-isomorphic signed graphs on a specific graph, we will establish a method based…
For an element a in a semigroup S the local subsemigroup of S with respect to a is the subsemigroup aSa of S and the variant of S with respect to a is a semigroup with underlying set S with a sandwich operation xy = xay for all x, y in S.…
In this paper we characterise graph inverse semigroups which admit only discrete locally compact semigroup topology. This characterization provides a complete answer on the question of Z. Mesyan, J. D. Mitchell, M. Morayne and Y. H.…
The low-energy expansion of closed-string scattering amplitudes at genus one introduces infinite families of non-holomorphic modular forms called modular graph forms. Their differential and number-theoretic properties motivated Brown's…
A rank 3 graph is an orbital graph of a rank 3 permutation group of even order. Despite the classification of rank 3 graphs being complete, see, e.g., Chapter 11 of the recent monograph 'Strongly regular graphs' by Brouwer and Van…
Homomorphically full graphs are those for which every homomorphic image is isomorphic to a subgraph. We extend the definition of homomorphically full to oriented graphs in two different ways. For the first of these, we show that…
We investigate various groupoids associated to an arbitrary inverse semigroup with zero. We show that the groupoid of filters with respect to the natural partial order is isomorphic to the groupoid of germs arising from the standard action…
Line graphs are an alternative representation of graphs where each vertex of the original (root) graph becomes an edge. However not all graphs have a corresponding root graph, hence the transformation from graphs to line graphs is not…
In this work we establish that finite directed graphs give rise to semiflows on the power set of their nodes. We analyze the topological dynamics for semiflows on finite directed graphs by characterizing Morse decompositions, recurrence…
A partial complement of the graph $G$ is a graph obtained from $G$ by complementing all the edges in one of its induced subgraphs. We study the following algorithmic question: for a given graph $G$ and graph class $\mathcal{G}$, is there a…
We study the semigroup $\mathscr{I}^{\mathrm{cf}}_\lambda$ of injective partial cofinite selfmaps of an infinite cardinal $\lambda$. We show that $\mathscr{I}^{\mathrm{cf}}_\lambda$ is a bisimple inverse semigroup and each chain of…
A mixed graph can be seen as a type of digraph containing some edges (two opposite arcs). Here we introduce the concept of sequence mixed graphs, which is a generalization of both sequence graphs and iterated line digraphs. These structures…
Consider the following generalization of the bicyclic monoid. Let $\kappa$ be any infinite cardinal and let $\mathcal{IP\!F}\left(\sigma{\mathbb{N}^\kappa}\right)$ be the semigroup of all order isomorphisms between principal filters of the…