AbstractWe consider four families of pancake graphs, which are Cayley graphs, whose vertex sets are either the symmetric group on n objects or the hyperoctahedral group on n objects and whose generating sets are either all reversals or all reversals inverting the first k elements (called prefix reversals). We find that the girth of each family of pancake graphs remains constant after some small threshold value of n
AbstractThe problem of reconstructing signed permutations on n elements from their erroneous pattern...
In this report paper we collect recent results on the vertex reconstruction in Cayley graphs $Cay(G,...
AbstractThe problem of reconstructing permutations on n elements from their erroneous patterns which...
AbstractWe consider four families of pancake graphs, which are Cayley graphs, whose vertex sets are ...
The Pancake graphs $P_n, n\geqslant 2$, are Cayley graphs over the symmetric group $\mathrm{Sym}_n$ ...
In this paper, we consider the lengths of cycles that can be embedded on the edges of the \emph{gene...
The pancake graph $P_n$ is the Cayley graph of the symmetric group $S_n$ on $n$ elements generated b...
The symmetric group Sn and the group of signed permutations Bn (also referred to as the hyperoctahed...
The "pancake problem" asks how many prefix reversals are sufficient to sort any permutation $\pi \in...
AbstractThe pancake problem asks for the minimum number of prefix reversals sufficient for sorting a...
Using existing classification results for the 7- and 8-cycles in the pancake graph, we determine the...
AbstractPancake flipping, a famous open problem in computer science, can be formalised as the proble...
We consider a number of problems in graph theory, with the unifying theme being the properties of gr...
AbstractFor a permutation σ of the integers from 1 to n, let ƒ(σ) be the smallest number of prefix r...
We start with an account of the known bounds for n(3,g), the number of vertices in the smallest triv...
AbstractThe problem of reconstructing signed permutations on n elements from their erroneous pattern...
In this report paper we collect recent results on the vertex reconstruction in Cayley graphs $Cay(G,...
AbstractThe problem of reconstructing permutations on n elements from their erroneous patterns which...
AbstractWe consider four families of pancake graphs, which are Cayley graphs, whose vertex sets are ...
The Pancake graphs $P_n, n\geqslant 2$, are Cayley graphs over the symmetric group $\mathrm{Sym}_n$ ...
In this paper, we consider the lengths of cycles that can be embedded on the edges of the \emph{gene...
The pancake graph $P_n$ is the Cayley graph of the symmetric group $S_n$ on $n$ elements generated b...
The symmetric group Sn and the group of signed permutations Bn (also referred to as the hyperoctahed...
The "pancake problem" asks how many prefix reversals are sufficient to sort any permutation $\pi \in...
AbstractThe pancake problem asks for the minimum number of prefix reversals sufficient for sorting a...
Using existing classification results for the 7- and 8-cycles in the pancake graph, we determine the...
AbstractPancake flipping, a famous open problem in computer science, can be formalised as the proble...
We consider a number of problems in graph theory, with the unifying theme being the properties of gr...
AbstractFor a permutation σ of the integers from 1 to n, let ƒ(σ) be the smallest number of prefix r...
We start with an account of the known bounds for n(3,g), the number of vertices in the smallest triv...
AbstractThe problem of reconstructing signed permutations on n elements from their erroneous pattern...
In this report paper we collect recent results on the vertex reconstruction in Cayley graphs $Cay(G,...
AbstractThe problem of reconstructing permutations on n elements from their erroneous patterns which...