On finite groups with a given number of centralizers
AR Ashrafi - Algebra colloquium, 2000 - Springer
For a finite group G, let Cent (G) denote the set of centralizers of single elements of G and#
Cent (G)=| Cent (G)|. G is called an n-centralizer group if# Cent (G)= n, and a primitive n …
Cent (G)=| Cent (G)|. G is called an n-centralizer group if# Cent (G)= n, and a primitive n …
Solvable groups whose degree graphs have two connected components
ML Lewis - 2001 - degruyter.com
Solvable groups whose degree graphs have two connected components Page 1 J. Group
Theory 4 (2001), 255±275 Journal of Group Theory ( de Gruyter 2001 Solvable groups whose …
Theory 4 (2001), 255±275 Journal of Group Theory ( de Gruyter 2001 Solvable groups whose …
Spectrum of commuting graphs of some classes of finite groups
J Dutta, RK Nath - arXiv preprint arXiv:1604.07133, 2016 - arxiv.org
In this paper, we initiate the study of spectrum of the commuting graphs of finite non-abelian
groups. We first compute the spectrum of this graph for several classes of finite groups, in …
groups. We first compute the spectrum of this graph for several classes of finite groups, in …
Laplacian and signless Laplacian spectrum of commuting graphs of finite groups
J Dutta, RK Nath - Khayyam journal of mathematics, 2018 - kjm-math.org
The commuting graph of a finite non-abelian group $ G $ with center $ Z (G) $, denoted by
$\Gamma_G $, is a simple undirected graph whose vertex set is $ G\setminus Z (G) $, and …
$\Gamma_G $, is a simple undirected graph whose vertex set is $ G\setminus Z (G) $, and …
Counting the centralizers of some finite groups
AR Ashrafi - Korean Journal of Computational and Applied …, 2000 - Springer
For a finite group G,# Cent (G) denotes the number of centralizers of its elements. A group G
is called n-centralizer if# Cent (G)= n, and primitive n-centralizer if\# Cent (G)=\# Cent (GZ …
is called n-centralizer if# Cent (G)= n, and primitive n-centralizer if\# Cent (G)=\# Cent (GZ …
Laplacian spectrum of non-commuting graphs of finite groups
In this paper, we compute the Laplacian spectrum of non-commuting graphs of some
classes of finite non-abelian groups. Our computations reveal that the non-commuting …
classes of finite non-abelian groups. Our computations reveal that the non-commuting …
[PDF][PDF] MST3 Cryptosystem Based on a Generalized Suzuki 2-groups.
G Khalimov, Y Kotukh, S Khalimova - ICST, 2020 - academia.edu
The article describes a new implementation of MST3 cryptosystems based on the
generalized Suzuki 2-groups. The main difference in the presented implementation is the …
generalized Suzuki 2-groups. The main difference in the presented implementation is the …
Encryption Scheme Based on the Generalized Suzuki 2-groups and Homomorphic Encryption
This article describes a new implementation of MST-based encryption for generalized
Suzuki 2-groups. The well-known MST cryptosystem based on Suzuki groups is built on a …
Suzuki 2-groups. The well-known MST cryptosystem based on Suzuki groups is built on a …
A solvable group whose character degree graph has diameter 3
ML Lewis - Proceedings of the American Mathematical Society, 2002 - JSTOR
A Solvable Group Whose Character Degree Graph Has Diameter 3 Page 1 PROCEEDINGS OF
THE AMERICAN MATHEMATICAL SOCIETY Volume 130, Number 3, Pages 625-630 S …
THE AMERICAN MATHEMATICAL SOCIETY Volume 130, Number 3, Pages 625-630 S …
Optimal line packings from nonabelian groups
We use group schemes to construct optimal packings of lines through the origin. In this
setting, optimal line packings are naturally characterized using representation theory, which …
setting, optimal line packings are naturally characterized using representation theory, which …