Solvable conjugacy class graph of groups

Publikation: Arbeitspapier/PreprintPreprint

Autoren

Forschungs-netzwerk anzeigen

Details

OriginalspracheEnglisch
PublikationsstatusElektronisch veröffentlicht (E-Pub) - 5 Dez. 2021

Abstract

In this paper we introduce the graph \(\Gamma_{sc}(G)\) associated with a group \(G\), called the solvable conjugacy class graph (abbreviated as SCC-graph), whose vertices are the nontrivial conjugacy classes of \(G\) and two distinct conjugacy classes \(C, D\) are adjacent if there exist \(x \in C\) and \(y \in D\) such that \(\langle x, y\rangle\) is solvable. We discuss the connectivity, girth, clique number, and several other properties of the SCC-graph. One of our results asserts that there are only finitely many finite groups whose SCC-graph has given clique number~\(d\), and we find explicitly the list of such groups with \(d=2\).

Zitieren

Solvable conjugacy class graph of groups. / Bhowal, Parthajit; Cameron, Peter J.; Nath, Rajat Kanti et al.
2021.

Publikation: Arbeitspapier/PreprintPreprint

Bhowal, P., Cameron, P. J., Nath, R. K., & Sambale, B. (2021). Solvable conjugacy class graph of groups. Vorabveröffentlichung online. http://arxiv.org/abs/2112.02613v3
Bhowal P, Cameron PJ, Nath RK, Sambale B. Solvable conjugacy class graph of groups. 2021 Dez 5. Epub 2021 Dez 5.
Bhowal, Parthajit ; Cameron, Peter J. ; Nath, Rajat Kanti et al. / Solvable conjugacy class graph of groups. 2021.
Download
@techreport{a1ace8fe2ac54d388840774d3725c1a6,
title = "Solvable conjugacy class graph of groups",
abstract = " In this paper we introduce the graph \(\Gamma_{sc}(G)\) associated with a group \(G\), called the solvable conjugacy class graph (abbreviated as SCC-graph), whose vertices are the nontrivial conjugacy classes of \(G\) and two distinct conjugacy classes \(C, D\) are adjacent if there exist \(x \in C\) and \(y \in D\) such that \(\langle x, y\rangle\) is solvable. We discuss the connectivity, girth, clique number, and several other properties of the SCC-graph. One of our results asserts that there are only finitely many finite groups whose SCC-graph has given clique number~\(d\), and we find explicitly the list of such groups with \(d=2\). ",
keywords = "math.CO, math.GR, 05C25",
author = "Parthajit Bhowal and Cameron, {Peter J.} and Nath, {Rajat Kanti} and Benjamin Sambale",
year = "2021",
month = dec,
day = "5",
language = "English",
type = "WorkingPaper",

}

Download

TY - UNPB

T1 - Solvable conjugacy class graph of groups

AU - Bhowal, Parthajit

AU - Cameron, Peter J.

AU - Nath, Rajat Kanti

AU - Sambale, Benjamin

PY - 2021/12/5

Y1 - 2021/12/5

N2 - In this paper we introduce the graph \(\Gamma_{sc}(G)\) associated with a group \(G\), called the solvable conjugacy class graph (abbreviated as SCC-graph), whose vertices are the nontrivial conjugacy classes of \(G\) and two distinct conjugacy classes \(C, D\) are adjacent if there exist \(x \in C\) and \(y \in D\) such that \(\langle x, y\rangle\) is solvable. We discuss the connectivity, girth, clique number, and several other properties of the SCC-graph. One of our results asserts that there are only finitely many finite groups whose SCC-graph has given clique number~\(d\), and we find explicitly the list of such groups with \(d=2\).

AB - In this paper we introduce the graph \(\Gamma_{sc}(G)\) associated with a group \(G\), called the solvable conjugacy class graph (abbreviated as SCC-graph), whose vertices are the nontrivial conjugacy classes of \(G\) and two distinct conjugacy classes \(C, D\) are adjacent if there exist \(x \in C\) and \(y \in D\) such that \(\langle x, y\rangle\) is solvable. We discuss the connectivity, girth, clique number, and several other properties of the SCC-graph. One of our results asserts that there are only finitely many finite groups whose SCC-graph has given clique number~\(d\), and we find explicitly the list of such groups with \(d=2\).

KW - math.CO

KW - math.GR

KW - 05C25

M3 - Preprint

BT - Solvable conjugacy class graph of groups

ER -

Von denselben Autoren