Zobrazeno 1 - 10
of 36
pro vyhledávání: '"Rajat Kanti Nath"'
Autor:
Monalisha Sharma, Rajat Kanti Nath
Publikováno v:
Electronic Journal of Graph Theory and Applications, Vol 10, Iss 1, Pp 113-130 (2022)
Let G be a finite group. For a fixed element g in G and a given subgroup H of G, the relative g-noncommuting graph of G is a simple undirected graph whose vertex set is G and two vertices x and y are adjacent if x ∈ H or y ∈ H and [x, y]≠g, g
Externí odkaz:
https://doaj.org/article/6669f76e3f114fd795d6144c19a30735
Publikováno v:
Mathematics, Vol 9, Iss 23, p 3147 (2021)
Let H be a subgroup of a finite non-abelian group G and g∈G. Let Z(H,G)={x∈H:xy=yx,∀y∈G}. We introduce the graph ΔH,Gg whose vertex set is G\Z(H,G) and two distinct vertices x and y are adjacent if x∈H or y∈H and [x,y]≠g,g−1, where [
Externí odkaz:
https://doaj.org/article/f439638bcdf5474896f35741cb59d280
Publikováno v:
Axioms, Vol 10, Iss 3, p 233 (2021)
Let R be a finite ring and r∈R. The r-noncommuting graph of R, denoted by ΓRr, is a simple undirected graph whose vertex set is R and two vertices x and y are adjacent if and only if [x,y]≠r and [x,y]≠−r. In this paper, we obtain expressions
Externí odkaz:
https://doaj.org/article/422341ac114c49d5aa1b67ad73422caa
Publikováno v:
Symmetry, Vol 13, Iss 9, p 1651 (2021)
The commuting graph of a finite non-abelian group G with center Z(G), denoted by Γc(G), is a simple undirected graph whose vertex set is G∖Z(G), and two distinct vertices x and y are adjacent if and only if xy=yx. Alwardi et al. (Bulletin, 2011, 3
Externí odkaz:
https://doaj.org/article/3fa527fafe414d138866bcc668cafea4
Autor:
Rajat Kanti Nath
Publikováno v:
Boletim da Sociedade Paranaense de Matemática, Vol 38, Iss 4 (2019)
Let $R$ be a nite non-commutative ring with center $Z(R)$. The commuting graph of $R$, denoted by $\Gamma_R$, is a simple undirected graph whose vertex set is $R\setminus Z(R)$ and two distinct vertices $x$ and $y$ are adjacent if and only if $xy = y
Externí odkaz:
https://doaj.org/article/7d27fc7be8a34a53884d8179a8f08b11
Publikováno v:
Proyecciones (Antofagasta). 41:263-273
Let Γ be a graph with the adjacency matrix A. The energy of Γ is the sum of the absolute values of the eigenvalues of A. In this article we compute the energies of the commuting graphs of some finite groups and discuss some consequences regarding h
Publikováno v:
Bulletin of the Malaysian Mathematical Sciences Society. 45:1255-1272
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 ve
Autor:
Parama Dutta, Rajat Kanti Nath
Publikováno v:
Indian Journal of Pure and Applied Mathematics. 52:1-10
A simple undirected graph $$\Gamma _G$$ whose vertex set is the set of non-central elements of a finite group G and two vertices x and y are adjacent if they commute is called commuting graph of G. In this paper, we compute energy, Laplacian energy a
Autor:
Parama Dutta, Rajat Kanti Nath
Publikováno v:
Volume: 49, Issue: 1 389-398
Hacettepe Journal of Mathematics and Statistics
Hacettepe Journal of Mathematics and Statistics
Let $H \subseteq K$ be two subgroups of a finite group $G$ and $\mathrm{Aut}(K)$ the automorphism group of $K$. In this paper, we consider the generalized autocommuting probability of $G$ relative to its subgroups $H$ and $K$, denoted by ${Pr}_g(H,\m
The fourth author is supported by the German Research Foundation (SA 2864/1-2 and SA 2864/3-1). 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 ve
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::813420b579276db1b647777a862bf733
http://arxiv.org/abs/2112.02613
http://arxiv.org/abs/2112.02613