SearcharxivSearch

arXiv subjects

Parthajit Bhowal

Publications and source records attributed to Parthajit Bhowal.

6 recordsLinked to original sources

Solvable conjugacy class graph of groups

In this paper we introduce the graph $Γ_{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$.

math.CO

Genus of commuting conjugacy class graph of groups

For a non-abelian group $G$, its commuting conjugacy class graph $\mathcal{CCC}(G)$ is a simple undirected graph whose vertex set is the set of conjugacy classes of the non-central elements of $G$ and two distinct vertices $x^G$ and $y^G$ are adjacent if there exists some elements $x' \in x^G$ and $y' \in y^G$ such that $x'y' = y'x'$. In this paper we compute the genus of $\mathcal{CCC}(G)$ for six well-known classes of non-abelian two-generated groups (viz. $D_{2n}, SD_{8n}, Q_{4m}, V_{8n}, U_{(n, m)}$ and $G(p, m, n)$) and determine whether $\mathcal{CCC}(G)$ for these groups are planar, toroidal, double-toroidal or triple-toroidal.

math.GR

Spectrum and energies of commuting conjugacy class graph of a finite group

In this paper we compute spectrum, Laplacian spectrum, signless Laplacian spectrum and their corresponding energies of commuting conjugacy class graph of the group $G(p, m, n) = \langle x, y : x^{p^m} = y^{p^n} = [x, y]^p = 1, [x, [x, y]] = [y, [x, y]] = 1\rangle$, where $p$ is any prime, $m \geq 1$ and $n \geq 1$. We derive some consequences along with the fact that commuting conjugacy class graph of $G(p, m, n)$ is super integral. We also compare various energies and determine whether commuting conjugacy class graph of $G(p, m, n)$ is hyperenergetic, L-hyperenergetic or Q-hyperenergetic.

math.GR

Spectral aspects of commuting conjugacy class graph of finite groups

The commuting conjugacy class graph of a non-abelian group $G$, denoted by $\mathcal{CCC}(G)$, is a simple undirected graph whose vertex set is the set of conjugacy classes of the non-central elements of $G$ and two distinct vertices $x^G$ and $y^G$ are adjacent if there exists some elements $x' \in x^G$ and $y' \in y^G$ such that $x'y' = y'x'$. In this paper we compute various spectra and energies of commuting conjugacy class graph of the groups $D_{2n}, Q_{4m}, U_{(n, m)}, V_{8n}$ and $SD_{8n}$. Our computation shows that $\mathcal{CCC}(G)$ is super integral for these groups. We compare various energies and as a consequence it is observed that $\mathcal{CCC}(G)$ satisfy E-LE Conjecture of Gutman et al. We also provide negative answer to a question posed by Dutta et al. comparing Laplacian and Signless Laplacian energy. Finally, we conclude this paper by characterizing the above mentioned groups $G$ such that $\mathcal{CCC}(G)$ is hyperenergetic, L-hyperenergetic or Q-hyperenergetic.

math.GR

Non-solvable graphs of groups

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 distinct vertices are adjacent if they generate a non-solvable subgroup. In this paper we study many properties of $\mathcal{NS}_G$. In particular, we obtain results on vertex degree, cardinality of vertex degree set, graph realization, domination number, vertex connectivity, independence number and clique number of $\mathcal{NS}_G$. We also consider two groups $G$ and $H$ having isomorphic non-solvable graphs and derive some properties of $G$ and $H$. Finally, we conclude this paper by showing that $\mathcal{NS}_G$ is neither planar, toroidal, double-toroidal, triple-toroidal nor projective.

math.GR

A note on solvable graphs of finite groups

Let $G$ be a finite non-solvable group with solvable radical $Sol(G)$. The solvable graph $Γ_s(G)$ of $G$ is a graph with vertex set $G\setminus Sol(G)$ and two distinct vertices $u$ and $v$ are adjacent if and only if $\langle u, v \rangle$ is solvable. We show that $Γ_s (G)$ is not a star graph, a tree, an $n$-partite graph for any positive integer $n \geq 2$ and not a regular graph for any non-solvable finite group $G$. We compute the girth of $Γ_s (G)$ and derive a lower bound of the clique number of $Γ_s (G)$. We prove the non-existence of finite non-solvable groups whose solvable graphs are planar, toroidal, double-toroidal, triple-toroidal or projective. We conclude the paper by obtaining a relation between $Γ_s (G)$ and the solvability degree of $G$.

math.GR