English
Related papers

Related papers: Abelian Groups With Isomorphic Intersection Graphs

200 papers

A proper abelian coloring of a cubic graph G by a finite abelian group A is any proper edge-coloring of G by the non-zero elements of A such that the sum of the colors of the three edges incident to any vertex v of G equals zero. It is…

Combinatorics · Mathematics 2024-02-12 Jelena Sedlar , Riste Škrekovski

Two Eulerian circuits, both starting and ending at the same vertex, are avoiding if at every other point of the circuits they are at least distance 2 apart. An Eulerian graph which admits two such avoiding circuits starting from any vertex…

Combinatorics · Mathematics 2023-04-24 Grahame Erskine , Terry Griggs , Robert Lewis , James Tuite

If G is a non-nilpotent group and nil(G) = {g \in G : <g, h> is nilpotent for all h\in G}, the nilpotent graph of G is the graph with set of vertices G-nil(G) in which two distinct vertices are related if they generate a nilpotent subgroup…

Group Theory · Mathematics 2024-08-05 Jaime Torres , Ismael Gutierrez , E. J. Garcia-Claro

If A and B are abelian varieties over a number field K such that there are non-trivial geometric homomorphisms of abelian varieties between reductions of A and B at most primes of K, then there exists a non-trivial (geometric) homomorphism…

Number Theory · Mathematics 2020-10-08 Chandrashekhar B. Khare , Michael Larsen

A road interchange where $n$ roads meet and in which the drivers are not allowed to change lanes can be modelled as an embedding of a 2-coloured (hence bipartite) multigraph $G$ with equal-sized colour classes into an orientable surface…

Combinatorics · Mathematics 2018-01-12 Valentas Kurauskas , Ugnė Šiurienė

Let A be a graph type and B an equivalence relation on a group $G$. Let $[g]$ be the equivalence class of $g$ with respect to the equivalence relation B. The B superA graph of $G$ is an undirected graph whose vertex set is $G$ and two…

Combinatorics · Mathematics 2025-09-24 G. Arunkumar , Peter J. Cameron , R. Ganeshbabu , Rajat Kanti Nath

A graph $\G$ admitting a group $H$ of automorphisms acting semi-regularly on the vertices with exactly two orbits is called a {\em bi-Cayley graph\/} over $H$. Such a graph $\G$ is called {\em normal\/} if $H$ is normal in the full…

Combinatorics · Mathematics 2016-06-16 Marston Conder , Jin-Xin Zhou , Yan-Quan Feng , Mi-Mi Zhang

The isomorphism problem of Cayley graphs has been well studied in the literature, such as characterizations of CI (DCI)-graphs and CI (DCI)-groups. In this paper, we generalize these to vertex-transitive graphs and establish parallel…

Combinatorics · Mathematics 2016-03-29 Jing Chen , Binzhou Xia

The \emph{power graph} $P(G)$ of a group $G$ is the graph whose vertex set is $G$, with $x$ and $y$ joined if one is a power of the other; the \emph{directed power graph} $\vec{P}(G)$ has the same vertex set, with an arc from $x$ to $y$ if…

Group Theory · Mathematics 2019-05-31 Peter J. Cameron , Horacio Guerra , Šimon Jurina

We present an infinite sequence of finite graphs with trivial automorphism group and non-trivial quantum automorphism group. These are the first known examples of graphs with this property. Moreover, to the best of our knowledge, these are…

Quantum Algebra · Mathematics 2025-11-12 Josse van Dobben de Bruyn , David E. Roberson , Simon Schmidt

In this paper, generalized Cayley graphs are studied. It is proved that every generalized Cayley graph of order 2p is a Cayley graph, where p is a prime. Special attention is given to generalized Cayley graphs on Abelian groups. It is…

Combinatorics · Mathematics 2015-12-02 Ademir Hujdurović , Klavdija Kutnar , Pawel Petecki , Anastasiya Tanana

This paper studies intersections of principal blocks of a finite group with respect to different primes. We first define the block graph of a finite group $G$, whose vertices are the prime divisors of $|G|$ and there is an edge between two…

Representation Theory · Mathematics 2017-07-20 Julian Brough , Yanjun Liu , Alessandro Paolini

A cubic graph $G$ is cyclically 5-connected if $G$ is simple, 3-connected, has at least 10 vertices and for every set $F$ of edges of size at most four, at most one component of $G\backslash F$ contains circuits. We prove that if $G$ and…

Combinatorics · Mathematics 2019-05-23 Neil Robertson , P. D. Seymour , Robin Thomas

Let $B$ be an equivalence relation defined on a finite group $G$. The $B$ super commuting graph on $G$ is a graph whose vertex set is $G$ and two distinct vertices $g$ and $h$ are adjacent if either $[g] = [h]$ or there exist $g' \in [g]$…

Group Theory · Mathematics 2025-11-07 Shrabani Das , Rajat Kanti Nath

Let $G$ be a group of permutations acting on an $n$-vertex set $V$, and $X$ and $Y$ be two simple graphs on $V$. We say that $X$ and $Y$ are $G$-isomorphic if $Y$ belongs to the orbit of $X$ under the action of $G$. One can naturally…

Combinatorics · Mathematics 2007-05-23 Bhalchandra D. Thatte

In this paper, we continue the study of the generator graph of a group. In 2023, Tacbobo [9] defined the generator graph of a nontrivial group to be the graph whose vertices are the elements of the group, with two vertices being adjacent if…

Combinatorics · Mathematics 2025-08-21 Zekhaya B. Shozi , Teresa L. Tacbobo

Let $G$ be a finite abelian group, written additively, and $H$ a subgroup of~$G$. The \emph{subgroup sum graph} $\Gamma_{G,H}$ is the graph with vertex set $G$, in which two distinct vertices $x$ and $y$ are joined if $x+y\in…

Combinatorics · Mathematics 2021-11-11 Peter J. Cameron , R. Raveendra Prathap , T. Tamizh Chelvam

Given a formation $\mathfrak F$, we consider the graph whose vertices are the elements of $G$ and where two vertices $g,h\in G$ are adjacent if and only if $\langle g,h \rangle \notin\mathfrak F$. We are interested in the two following…

Group Theory · Mathematics 2020-08-20 Andrea Lucchini , Daniele Nemmi

Given a finite abelian group $G$ and cyclic subgroups $A$, $B$, $C$ of $G$ of the same order, we find necessary and sufficient conditions for $A$, $B$, $C$ to admit a common transversal for the cosets they afford. For an arbitrary number of…

Group Theory · Mathematics 2025-02-21 Stefanos Aivazidis , Maria Loukaki , Benjamin Sambale

A group G is almost cyclic if there is an element x in G, such that for all g in G, there is an element y in G and an integer n with ygy^{-1} = x^n (that is, every element is conjugate to some power of x). W. Ziller asked whether there are…

Group Theory · Mathematics 2007-05-23 Bruce Ikenaga