English
Related papers

Related papers: The N-prime graph and the Subgroup Isomorphism Pro…

200 papers

We study the finite solvable groups $G$ in which every real element has prime power order. We divide our examination into two parts: the case $\textbf{O}_2(G)>1$ and the case $\textbf{O}_2(G)=1$. Specifically we proved that if…

Group Theory · Mathematics 2025-04-14 Alessandro Giorgi

Let G be a finite group and let Irr(G) be the set of all irreducible complex characters of G. Let cd(G) be the set of all character degrees of G and denote by \rho(G) the set of primes which divide some character degrees of G. The prime…

Group Theory · Mathematics 2013-08-27 Hung P. Tong-Viet

This is my old unpublished paper called "The generalized Grassmann invariant". It shows how "pictures" also known as "Peiffer diagrams" represent elements of $H_3G$ for any group $G$ and shows that $K_3(\mathbb Z [G])$ is isomorphic to a…

Algebraic Topology · Mathematics 2025-03-25 Kiyoshi Igusa

In the past decades for more and more graph classes the Graph Isomorphism Problem was shown to be solvable in polynomial time. An interesting family of graph classes arises from intersection graphs of geometric objects. In this work we show…

Data Structures and Algorithms · Computer Science 2016-06-23 Daniel Neuen

A graph $G=(V,E)$ is $\gamma$-excellent if $V$ is a union of all $\gamma$-sets of $G$, where $\gamma$ stands for the domination number. Let $\mathcal{I}$ be a set of all mutually nonisomorphic graphs and $\emptyset \not= \mathcal{H}…

Combinatorics · Mathematics 2020-10-08 Vladimir Samodivkin

Let $K$ be a field and $G$ be a finite group. Let $G$ act on the rational function field $K(x(g):g\in G)$ by $K$ automorphisms defined by $g\cdot x(h)=x(gh)$ for any $g,h\in G$. Denote by $K(G)$ the fixed field $K(x(g):g\in G)^G$. Noether's…

Algebraic Geometry · Mathematics 2016-01-20 Ivo M. Michailov

We introduce and study the pinnacle sets of a simple graph $G$ with $n$ vertices. Given a bijective vertex labeling $\lambda\,:\,V(G)\rightarrow [n]$, the label $\lambda(v)$ of vertex $v$ is a pinnacle of $(G, \lambda)$ if…

Combinatorics · Mathematics 2024-07-01 Chassidy Bozeman , Christine Cheng , Pamela E. Harris , Stephen Lasinis , Shanise Walker

Let $G$ be a group and $Sol(G)=\{x \in G : \langle x,y \rangle \text{ is solvable for all } y \in G\}$. We associate a graph $\mathcal{NS}_G$ (called the non-solvable graph of $G$) with $G$ whose vertex set is $G \setminus Sol(G)$ and two…

Group Theory · Mathematics 2019-09-27 Parthajit Bhowal , Deiborlang Nongsiang , Rajat Kanti Nath

For a graph $\Gamma$ and group $G$, $G^\Gamma$ is the subgroup of $G^{|\Gamma|}$ generated by elements with $g$ in the coordinates corresponding to $v$ and its neighbors in $\Gamma$. There is a natural epimorphism $G^\Gamma \to…

Combinatorics · Mathematics 2025-10-14 Gabe Cunningham , Igor Minevich

The prime simplicial complex $\Pi(G)$ of a finite group $G$ is composed of all sets of primes $S$ where $G$ has an element of order the product of primes in $S$, with the subsets partially ordered by inclusion. This complex was introduced…

Group Theory · Mathematics 2025-07-21 Melissa Lee , Kamilla Rekvényi

Given a finite group $G$, the generating graph $\Gamma(G)$ of $G$ has as vertices the (nontrivial) elements of $G$ and two vertices are adjacent if and only if they are distinct and generate $G$ as group elements. In this paper we…

Group Theory · Mathematics 2017-05-24 Andrea Lucchini , Claude Marion

Let $G$ be 2-generated group. The generating graph $\Gamma(G)$ of $G$ is the graph whose vertices are the elements of $G$ and where two vertices $g$ and $h$ are adjacent if $G = \langle g, h \rangle.$ This definition can be extended to a…

Group Theory · Mathematics 2020-02-18 Andrea Lucchini

A graph $G$ is called self-ordered (a.k.a asymmetric) if the identity permutation is its only automorphism. Equivalently, there is a unique isomorphism from $G$ to any graph that is isomorphic to $G$. We say that $G=(V,E)$ is robustly…

Computational Complexity · Computer Science 2023-06-22 Oded Goldreich , Avi Wigderson

A {\it graph product} $G$ on a graph $\Gamma$ is a group defined as follows: For each vertex $v$ of $\Gamma$ there is a corresponding non-trivial group $G_v$. The group $G$ is the quotient of the free product of the $G_v$ by the commutation…

Group Theory · Mathematics 2020-04-24 Michael Mihalik

For a group $G,$ the enhanced power graph of $G$ is a graph with vertex set $G$ in which two distinct elements $x, y$ are adjacent if and only if there exists an element $w$ in $G$ such that both $x$ and $y$ are powers of $w.$ The proper…

Combinatorics · Mathematics 2021-08-12 Sudip Bera , Hiranya Kishore Dey

Let $G$ be a group, $F$ a field, and $A$ a finite-dimensional central simple algebra over $F$ on which $G$ acts by $F$-algebra automorphisms. We study the ideals and subalgebras of $A$ which are preserved by the group action. Let $V$ be the…

Representation Theory · Mathematics 2007-05-23 Daniel S. Sage

Let $W(G)$ be the Wiener index of a graph $G$. We say that a vertex $v \in V(G)$ is a \v{S}olt\'es vertex in $G$ if $W(G - v) = W(G)$, i.e. the Wiener index does not change if the vertex $v$ is removed. In 1991, \v{S}olt\'es posed the…

Combinatorics · Mathematics 2024-06-05 Nino Bašić , Martin Knor , Riste Škrekovski

Let V_* be the normalized unitary subgroup of the modular group algebra FG of a finite p-group G over a finite field F with the classical involution *. We investigate the isomorphism problem for the group V_*, that asks when the group V_*…

Rings and Algebras · Mathematics 2020-05-20 Zsolt Balogh , Victor Bovdi

Given a finite group $G$, denote by $\Gamma(G)$ the simple undirected graph whose vertices are the distinct sizes of noncentral conjugacy classes of $G$, and set two vertices of $\Gamma(G)$ to be adjacent if and only if they are not coprime…

Group Theory · Mathematics 2013-06-10 Mariagrazia Bianchi , Rachel D. Camina , Marcel Herzog , Emanuele Pacifici

Given a graph $G$, the (graph theory) general position problem is to find the maximum number of vertices such that no three vertices lie on a common geodesic. This graph invariant is called the general position number (gp-number for short)…

Combinatorics · Mathematics 2017-10-03 Paul Manuel , Sandi Klavžar