Related papers: Automorphism Groups of the Pancake Graphs
There are a variety of ways to associate directed or undirected graphs to a group. It may be interesting to investigate the relations between the structure of these graphs and characterizing certain properties of the group in terms of some…
The generalized $k$-connectivity $\kappa_{k}(G)$ of a graph $G$ is a parameter that can measure the reliability of a network $G$ to connect any $k$ vertices in $G$, which is proved to be NP-complete for a general graph $G$. Let $S\subseteq…
The series-parallel (SP) graphs are those containing no topological $K_{_4}$ and are considered trivial. We relax the prohibition distinguishing the SP graphs by forbidding only embeddings of $K_{_4}$ whose edges with both ends 3-valent…
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…
We construct a model for the space of automorphisms of a connected p-compact group in terms of the space of automorphisms of its maximal torus normalizer and its root datum. As a consequence we show that any homomorphism to the outer…
For a graph $G$ and for two distinct vertices $u$ and $v$, let $\kappa(u,v)$ be the maximum number of vertex-disjoint paths joining $u$ and $v$ in $G$. The average connectivity matrix of an $n$-vertex connected graph $G$, written…
The symmetries of a finite graph are described by its automorphism group; in the setting of Woronowicz's quantum groups, a notion of a quantum automorphism group has been defined by Banica capturing the quantum symmetries of the graph. In…
Hypergraphs generalize classical graphs by allowing a single edge to connect multiple vertices, providing a natural language for modeling higher-order interactions. Superhypergraphs extend this paradigm further by accommodating nested,…
Random graphs offer a useful mathematical representation of a variety of real world complex networks. Exponential random graphs, for example, are particularly suited towards generating random graphs constrained to have specified statistical…
Graph neural networks (GNNs) are commonly described as being permutation equivariant with respect to node relabeling in the graph. This symmetry of GNNs is often compared to the translation equivariance of Euclidean convolution neural…
A graph with a semiregular group of automorphisms can be thought of as the derived cover arising from a voltage graph. Since its inception, the theory of voltage graphs and their derived covers has been a powerful tool used in the study of…
We study the connectivity of proper power graphs of some family of finite groups including nilpotent groups, groups with a non-trivial partition, and symmetric and alternating groups.
We study the automorphism group of graphons (graph limits). We prove that after an appropriate "standardization" of the graphon, the automorphism group is compact. Furthermore, we characterize the orbits of the automorphism group on…
A graph drawn on the plane is called $1$-plane if each edge is crossed at most once by another edge. In this paper, we show that every $4$-connected $1$-plane graph has a connected spanning plane subgraph. We also show that there exist…
Any complex-analytic vector bundle $\mathbb E$ admits naturally defined homotheties $\phi_{\alpha}$, $\alpha\in \mathbb C^*$, i.e. $\phi_{\alpha}$ is the multiplication of a local section by a complex number $\alpha$. We investigate the…
The family of generalized Paley graphs of prime power order $q$ and degree $(q-1)/k$ is studied. It is shown that the automorphism group of a graph in this family is a subgroup of ${\mathrm{A\Gamma L}}(1,q)$ whenever $q$ is sufficiently…
A graph $\Gamma$ is $k$-connected-homogeneous ($k$-CH) if $k$ is a positive integer and any isomorphism between connected induced subgraphs of order at most $k$ extends to an automorphism of $\Gamma$, and connected-homogeneous (CH) if this…
Let $G$ be a group. The power graph of $G$ is a graph with vertex set $G$ in which two distinct elements $x,y$ are adjacent if one of them is a power of the other. We characterize all groups whose power graphs have finite independence…
In many ways, graphs are the main modality of data we receive from nature. This is due to the fact that most of the patterns we see, both in natural and artificial systems, are elegantly representable using the language of graph structures.…
Median graphs are connected graphs in which for all three vertices there is a unique vertex that belongs to shortest paths between each pair of these three vertices. In this paper we provide several novel characterizations of planar median…