>
Fa   |   Ar   |   En
   on co-maximal subgroup graph of $d_n$  
   
نویسنده das angsuman ,saha manideepa
منبع communications in combinatorics and optimization - 2025 - دوره : 10 - شماره : 3 - صفحه:701 -715
چکیده    Let $g$ be a group and $s$ be the collection of all non-trivial proper subgroups of $g$. the co-maximal subgroup graph $gamma(g)$ of a group $g$ is defined to be a graph with $s$ as the set of vertices and two distinct vertices $h$ and $k$ are adjacent if and only if $hk=g$. in this paper, we study the comaximal subgroup graph on finite dihedral groups. in particular, we study order, maximum and minimum degree, diameter, girth, domination number, chromatic number and perfectness of comaximal subgroup graph of dihedral groups. moreover, we prove some isomorphism results on comaximal subgroup graph of dihedral groups.
کلیدواژه dihedral group ,graph isomorphism ,perfect graph
آدرس presidency university, department of mathematics, india, national institute of science education and research (niser), school of mathematical sciences, india
پست الکترونیکی manideepasaha1991@gmail.com
 
     
   
Authors
  
 
 

Copyright 2023
Islamic World Science Citation Center
All Rights Reserved