Signed graphs and signed cycles of hyperoctahedral groups
From MaRDI portal
Abstract: For a graph with edge ordering, a linear order on the edge set, we obtain a permutation of vertices by considering the edges as transpositions of endvertices. It is known from D'enes' results that the permutation of a tree is a full cyclic for any edge ordering. As a corollary, D'enes counted up the number of representations of a full cyclic permutation by means of product of the minimal number of transpositions. Moreover, a graph with an edge ordering which the permutation is a full cyclic is characterized by graph embedding. In this article, we consider an analogy of these results for signed graphs and hyperoctahedral groups. We give a necessary and sufficient condition for a signed graph to have an edge ordering such that the permutation is an even (or odd) full cyclic. We show that the edge ordering of the signed tree with some loops always gives an even (or odd) full cyclic permutation and count up the number of representations of an odd full cyclic permutation by means of product of the minimal number of transpositions.
Recommendations
Cites work
- scientific article; zbMATH DE number 3149991 (Why is no real title available?)
- scientific article; zbMATH DE number 47598 (Why is no real title available?)
- scientific article; zbMATH DE number 3401124 (Why is no real title available?)
- A solution to a problem of Dénes: A bijection between trees and factorizations of cyclic permutations
- Chromatic symmetric functions via the group algebra of \(S_n\)
- Counting factorizations of Coxeter elements into products of reflections.
- Mirrors and reflections. The geometry of finite reflection groups.
- Representations of permutation groups II
- Representations of permutation groups. Part I
Cited in
(6)- Hyperoctahedral Eulerian idempotents, Hodge decompositions, and signed graph coloring complexes
- Signed excedance enumeration in the hyperoctahedral group
- Upper embeddability of graphs and products of transpositions associated with edges
- scientific article; zbMATH DE number 1043919 (Why is no real title available?)
- Computation of the eigenvalues of complete signed graphs
- Representation of signed graphs by root system \(E_ 8\)
This page was built for publication: Signed graphs and signed cycles of hyperoctahedral groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6090320)