English
Related papers

Related papers: Complete graph decompositions and p-groupoids

200 papers

Let S be a finite graph and G be the corresponding free partially commutative group. In this paper we study subgroups generated by vertices of the graph S, which we call canonical parabolic subgroups. A natural extension of the definition…

Group Theory · Mathematics 2007-05-23 A. J. Duncan , I. V. Kazachkov , V. N. Remeslennikov

Distance-hereditary graphs are known to be the graphs that are totally decomposable for the split decomposition. We characterise distance-hereditary graphs whose complement is also distance-hereditary by their split decomposition and by…

Combinatorics · Mathematics 2026-04-13 Hugo Jacob

We investigate structural and combinatorial properties of Bi-Cayley graphs defined over cyclic groups of order $p^2q^2$, where $p$ and $q$ are distinct primes. We begin by describing their fundamental group-theoretic underpinnings. The main…

Combinatorics · Mathematics 2026-03-11 Iqbal Atmaja , Yeni Susanti , Ahmad Erfanian

For quasifields, the concept of parastrophy is slightly weaker than isotopy. Parastrophic quasifields yield isomorphic translation planes but not conversely. We investigate the right multiplication groups of finite quasifields. We classify…

Combinatorics · Mathematics 2019-09-10 Gábor P. Nagy

The class of quasi-chain graphs is an extension of the well-studied class of chain graphs. This latter class enjoys many nice and important properties, such as bounded clique-width, implicit representation, well-quasi-ordering by induced…

Combinatorics · Mathematics 2021-04-12 Bogdan Alecu , Aistis Atminas , Vadim Lozin , Dmitriy Malyshev

For G a group and g in G, we define mappings pg(G) and lg(G) from G into G by pg(x)=[x,g] and lg(x)=[g,x]. We let P(G) and L(G) denote the subsemigroups of the set of all mappings from G to G generated by {pg: g in G} and {lg: g in G},…

Rings and Algebras · Mathematics 2013-03-05 Darien DeWolf , Charles Edmunds , Christopher Levy

In this paper, we first characterize which generalized lexicographic products are divisor graphs. As applications, we show that power graphs, reduced power graphs and order graphs are all divisor graphs, which also implies the main result…

Group Theory · Mathematics 2026-03-02 Xuanlong Ma , Liangliang Zhai , Nan Gao , Junyao Pan

A vertex triple $(u,v,w)$ of a graph is called a $2$-geodesic if $v$ is adjacent to both $u$ and $w$ and $u$ is not adjacent to $w$. A graph is said to be $2$-geodesic transitive if its automorphism group is transitive on the set of…

Combinatorics · Mathematics 2022-07-28 Jun-Jie Huang , Yan-Quan Feng , Jin-Xin Zhou , Fu-Gang Yin

In this note, an intrinsic description of some families of linear codes with symmetries is given, showing that they can be described more generally as quasi group codes, that is, as linear codes allowing a group of permutation automorphisms…

Information Theory · Computer Science 2021-11-11 Martino Borello , Wolfgang Willems

For finite p-groups P of class 2 and exponent p the following are invariants of fully refined central decompositions of P: the number of members in the decomposition, the multiset of orders of the members, and the multiset of orders of…

Group Theory · Mathematics 2009-10-01 James B. Wilson

For each prime p, we exhibit pairs of p-groups all of whose integral cohomology groups are isomorphic. The method used involves very little calculation. The groups are exhibited as kernels of homomorphisms from a compact Lie group G to…

Algebraic Topology · Mathematics 2007-12-03 Ian J. Leary

Let $G$ be a group. The intersection graph of subgroups of $G$, denoted by $\mathscr{I}(G)$, is a graph with all the proper subgroups of $G$ as its vertices and two distinct vertices in $\mathscr{I}(G)$ are adjacent if and only if the…

Group Theory · Mathematics 2015-06-03 R. Rajkumar , P. Devi

Graph inverse semigroups generalize the polycyclic inverse monoids and play an important role in the theory of C*-algebras. This paper has two main goals: first, to provide an abstract characterization of graph inverse semigroups; and…

Category Theory · Mathematics 2013-08-14 David G. Jones , Mark V. Lawson

Simple drawings are drawings of graphs in which any two edges intersect at most once (either at a common endpoint or a proper crossing), and no edge intersects itself. We analyze several characteristics of simple drawings of complete…

Computational Geometry · Computer Science 2023-08-22 Oswin Aichholzer , Birgit Vogtenhuber , Alexandra Weinberger

We describe the full automorphism group of the directed reduced power graph and the undirected reduced power graph of a finite group. We compute the full automorphism groups of these graphs of several classes of finite groups. Also, we…

Group Theory · Mathematics 2024-11-15 T. Anitha , R. Rajkumar

We are concerned with split graphs and pseudo-split graphs whose complements are isomorphic to themselves. These special subclasses of self-complementary graphs are actually the core of self-complementary graphs. Indeed, we show that all…

Combinatorics · Mathematics 2023-12-19 Yixin Cao , Haowei Chen , Shenghua Wang

This paper concerns finite groups of class (at most) two and of odd prime exponent $p$. Such a group is called special if the center lies within its derived group. Every group of class 2 and exponent $p$ can be uniquely expressed as the…

Group Theory · Mathematics 2017-10-17 Douglas B. Tyler

In this note, we study non-transitive graphs and prove a number of results when they satisfy a coarse version of transitivity. Also, for each finitely generated group $G$, we produce continuum many pairwise non-quasi-isometric regular…

Group Theory · Mathematics 2022-07-20 Josiah Oh , Mark Pengitore

Let $p$ be a prime and $G$ a subgroup of $GL_d(p)$. We define $G$ to be $p$-exceptional if it has order divisible by $p$, but all its orbits on vectors have size coprime to $p$. We obtain a classification of $p$-exceptional linear groups.…

Group Theory · Mathematics 2014-01-21 Michael Giudici , Martin W. Liebeck , Cheryl E. Praeger , Jan Saxl , Pham Huu Tiep

Let $G$ be a finite group and let $S$ be an inverse-closed subset of $G$ not containing the identity. The Cayley graph $\mathrm{Cay}(G,S)$ has vertex set $G$, where two vertices $x$ and $y$ are adjacent if and only if $x^{-1}y \in S$.…

Combinatorics · Mathematics 2026-01-06 Amitayu Banerjee
‹ Prev 1 3 4 5 6 7 10 Next ›