English
Related papers

Related papers: Symmetric Graphicahedra

200 papers

Let P and Q be convex polyhedra in E3 with face lattices F(P) and F(Q) and symmetry groups G(P) and G(Q), respectively. Then, P and Q are called face equivalent if there is a lattice isomorphism between F(P) and F(Q); P and Q are called…

Metric Geometry · Mathematics 2015-09-01 M. Rostami , Henrique F. da Cruz , Ilda I. Rodrigues

For a group $G$ and a subset $X$ of $G$, the commuting graph of $X$, denoted by $\Gamma(G,X)$ is the graph whose vertex set is $X$ and any two vertices $u$ and $v$ in $X$ are adjacent if and only if they commute in $G$. In this article,…

Combinatorics · Mathematics 2018-06-12 Vipul Kakkar , Gopal Singh Rawat

In this paper the structure of the Cayley graphs and G-graphs of some gyro-groups are studied and some properties of them will be proved. Moreover we review some special gyro-groups including: gyro-commutative gyrogroups, dihedral…

Combinatorics · Mathematics 2024-05-01 Neda Moradi , Gholam Hossein Fath-Tabara , Alain Bretto

The study of graph C*-algebras has a long history in operator algebras. Surprisingly, their quantum symmetries have never been computed so far. We close this gap by proving that the quantum automorphism group of a finite, directed graph…

Operator Algebras · Mathematics 2018-05-07 Simon Schmidt , Moritz Weber

We study quantum automorphism group of vertex-transitive graphs using intertwinner spaces of the magic unitary matrix associated to this quantum subgroups of $S_n^+$. We also give some applications to quantum symmetries of circulant graphs…

Quantum Algebra · Mathematics 2019-04-03 Arthur Chassaniol

We classify non-complete prime valency graphs satisfying the property that their automorphism group is transitive on both the set of arcs and the set of $2$-geodesics. We prove that either $\Gamma$ is 2-arc transitive or the valency $p$…

Combinatorics · Mathematics 2015-04-20 Alice Devillers , Wei Jin , Cai Heng Li , Cheryl E. Praeger

To each quadratic number field $K$ and each quadratic polynomial $f$ with $K$-coefficients, one can associate a finite directed graph $G(f,K)$ whose vertices are the $K$-rational preperiodic points for $f$, and whose edges reflect the…

Number Theory · Mathematics 2021-08-12 John R. Doyle , Xander Faber , David Krumm

Finite connected cubic symmetric graphs of girth 6 have been classified by K. Kutnar and D. Maru\v{s}i\v{c}, in particular, each of these graphs has an abelian automorphism group with two orbits on the vertex set. In this paper all cubic…

Combinatorics · Mathematics 2015-04-14 Hiroki Koike , István Kovács

In 3-dimensional Euclidean space there exist two exceptional polyhedra, the rhombic dodecahedron and the rhombic triacontahedron, the only known polytopes (besides polygons) that are edge-transitive without being vertex-transitive. We show…

Metric Geometry · Mathematics 2021-10-29 Frank Göring , Martin Winter

In this paper we introduce the symmetric normaliser graph of a group $G$. The vertex set of this graph consists of elements of the group. Vertices $x$ and $y$ are adjacent if $x$ lies in the normaliser of $\langle y \rangle$ and $y$ lies in…

Group Theory · Mathematics 2026-01-28 Surbhi , Geetha Venkataraman

Circulant graphs are a widely studied family of graphs whose members possess varying amounts of symmetry. Although considerable progress has been made in finding the automorphism groups of circulant graphs under certain restrictions, a…

Combinatorics · Mathematics 2026-05-15 Sally Cockburn , Ryhory Hatavets , Will Swartz

The Gilbert graph $\text{Gilbert}(q,n,d)$, which arises naturally in graph theory and coding theory, is the regular graph on $\mathbb{F}_q^n$ in which two vertices are adjacent if their Hamming distance is less than $d$, and it is…

Combinatorics · Mathematics 2026-03-24 Noam Krupnik , Igal Sason , Abraham Berman

A Cayley Graph for a group $G$ is called normal edge-transitive if it admits an edge-transitive action of some subgroup of the Holomorph of $G$ (the normaliser of a regular copy of $G$ in $\operatorname{Sym}(G)$). We complete the…

Combinatorics · Mathematics 2014-01-10 Brian P. Corr , Cheryl E. Praeger

A polyhedron is a graph $G$ which is simple, planar and 3-connected. In this note, we classify the family of strongly involutive self-dual polyhedra. The latter is done by using a well-known result due to Tutte characterizing 3-connected…

Combinatorics · Mathematics 2020-05-11 Javier Bracho , Luis Montejano , Eric Pauli , Jorge Luis Ramirez Alfonsin

A graph $\Gamma$ is $G$-symmetric if $G$ is a group of automorphisms of $\Gamma$ which is transitive on the set of ordered pairs of adjacent vertices of $\Gamma$. If $V(\Gamma)$ admits a nontrivial $G$-invariant partition ${\cal B}$ such…

Combinatorics · Mathematics 2019-08-06 Yu Qing Chen , Teng Fang , Sanming Zhou

We identify the cotangent bundle Lie algebroid of a Poisson homogeneous space G/H of a Poisson Lie group G as a quotient of a transformation Lie algebroid over G. As applications, we describe the modular vector fields of G/H, and we…

Differential Geometry · Mathematics 2007-06-12 Jiang-Hua Lu

It is known that a connected simple graph $G$ associates a simple polytope $P_G$ called a graph associahedron in Euclidean space. In this paper we show that the set of facet vectors of $P_G$ forms a root system if and only if $G$ is a cycle…

Algebraic Topology · Mathematics 2016-02-15 Miho Hatanaka

The Eichler-Shimura isomorphism realizes the automorphic representation generated by an automorphic newform in certain cohomology of an arithmetic group. In this short note, we give a cohomological interpretation of the Eichler-Shimura…

Number Theory · Mathematics 2017-01-04 Santiago Molina Blanco

The mapping class group of a closed surface of genus $g$ is an extension of the Torelli group by the symplectic group. This leads to two natural problems: (a) compute (stably) the symplectic decomposition of the lower central series of the…

Geometric Topology · Mathematics 2017-12-12 Stavros Garoufalidis , Ezra Getzler

Let $e$ be a positive integer, $p$ be an odd prime, $q=p^{e}$, and $\Bbb F_q$ be the finite field of $q$ elements. Let $f,g \in \Bbb F_q [X,Y]$. The graph $G=G_q(f,g)$ is a bipartite graph with vertex partitions $P=\Bbb F_q^3$ and $L=\Bbb…

Combinatorics · Mathematics 2015-07-21 Xiang-dong Hou , Stephen D. Lappano , Felix Lazebnik