scholarly journals Non-commuting graph of the dihedral group determined by Hosoya parameters

Author(s):  
Muhammad Salman ◽  
Tahira Noreen ◽  
Masood Ur Rehman ◽  
Jinde Cao ◽  
Muhammad Zafar Abbas
2020 ◽  
Vol 8 (2) ◽  
pp. 233
Author(s):  
Sanhan Muhammad Salih Khasraw ◽  
Ivan Dler Ali ◽  
Rashad Rashid Haji

2017 ◽  
Vol 3 (1) ◽  
pp. 1-4
Author(s):  
Abdussakir Abdussakir

Commuting graph C(G) of a non-Abelian group G is a graph that contains all elements of G as its vertex set and two distinct vertices in C(G) will be adjacent if they are commute in G. In this paper we discuss commuting graph of dihedral group D2n. We show radius, diameter, cycle multiplicity, and metric dimension of this commuting graph in several theorems with their proof.


Author(s):  
Subarsha Banerjee

The non-commuting graph [Formula: see text] of a finite group [Formula: see text] has vertex set as [Formula: see text] and any two vertices [Formula: see text] are adjacent if [Formula: see text]. In this paper, we have determined the metric dimension and resolving polynomial of [Formula: see text], where [Formula: see text] is the dihedral group of order [Formula: see text]. The distance spectrum of [Formula: see text] has also been determined for all [Formula: see text].


2016 ◽  
Vol 44 (6) ◽  
pp. 2389-2401 ◽  
Author(s):  
Faisal Ali ◽  
Muhammad Salman ◽  
Shuliang Huang

CAUCHY ◽  
2017 ◽  
Vol 4 (4) ◽  
pp. 176 ◽  
Author(s):  
Abdussakir Abdussakir ◽  
Rivatul Ridho Elvierayani ◽  
Muflihatun Nafisah

Study about spectra of graph has became interesting work as well as study about commuting and non commuting graph of a group or a ring. But the study about spectra of commuting and non commuting graph of dihedral group has not been done yet. In this paper, we investigate adjacency spectrum, Laplacian spectrum, signless Laplacian spectrum, and detour spectrum of commuting and non commuting graph of dihedral group <em>D</em><sub>2<em>n</em></sub>


2021 ◽  
Vol 1722 ◽  
pp. 012051
Author(s):  
A G Syarifudin ◽  
Nurhabibah ◽  
D P Malik ◽  
I G A W Wardhana
Keyword(s):  

2021 ◽  
Vol 20 (3) ◽  
Author(s):  
Ying Liu ◽  
Jia-bin Yuan ◽  
Wen-jing Dai ◽  
Dan Li

Author(s):  
NICOLAS F. BEIKE ◽  
RACHEL CARLETON ◽  
DAVID G. COSTANZO ◽  
COLIN HEATH ◽  
MARK L. LEWIS ◽  
...  

Abstract Morgan and Parker proved that if G is a group with ${\textbf{Z}(G)} = 1$ , then the connected components of the commuting graph of G have diameter at most $10$ . Parker proved that if, in addition, G is solvable, then the commuting graph of G is disconnected if and only if G is a Frobenius group or a $2$ -Frobenius group, and if the commuting graph of G is connected, then its diameter is at most $8$ . We prove that the hypothesis $Z (G) = 1$ in these results can be replaced with $G' \cap {\textbf{Z}(G)} = 1$ . We also prove that if G is solvable and $G/{\textbf{Z}(G)}$ is either a Frobenius group or a $2$ -Frobenius group, then the commuting graph of G is disconnected.


Sign in / Sign up

Export Citation Format

Share Document