Maximum and minimum degree energy of commuting graph for dihedral groups
If is a finite group and is the centre of , then the commuting graph for , denoted by , has as its vertices set with two distinct vertices and are adjacent if . The degree of the vertex of , denoted by , is the number of vertices adjacent to . The maximum (or minimum) degree matrix...
| Κύριοι συγγραφείς: | , |
|---|---|
| Μορφή: | Άρθρο |
| Έκδοση: |
Penerbit UKM
2022
|
| _version_ | 1825938655405932544 |
|---|---|
| author | Romdhini, Mamika Ujianita Nawawi, Athirah |
| author_facet | Romdhini, Mamika Ujianita Nawawi, Athirah |
| author_sort | Romdhini, Mamika Ujianita |
| collection | UPM |
| description | If is a finite group and is the centre of , then the commuting graph for , denoted by , has as its vertices set with two distinct vertices and are adjacent if . The degree of the vertex of , denoted by , is the number of vertices adjacent to . The maximum (or minimum) degree matrix of is a square matrix whose -th entry is whenever and are adjacent, otherwise, it is zero. This study presents the maximum and minimum degree energies of for dihedral groups of order , by using the absolute eigenvalues of the corresponding maximum degree matrices ( ) and minimum degree matrices ( ).Here, the comparison of maximum and minimum degree energy of for is discussed by considering odd and even cases. The result shows that for each case, both energies are non-negative even integers and always equal. |
| first_indexed | 2024-03-06T11:16:43Z |
| format | Article |
| id | upm.eprints-102147 |
| institution | Universiti Putra Malaysia |
| last_indexed | 2024-03-06T11:16:43Z |
| publishDate | 2022 |
| publisher | Penerbit UKM |
| record_format | dspace |
| spelling | upm.eprints-1021472024-01-16T03:56:22Z http://psasir.upm.edu.my/id/eprint/102147/ Maximum and minimum degree energy of commuting graph for dihedral groups Romdhini, Mamika Ujianita Nawawi, Athirah If is a finite group and is the centre of , then the commuting graph for , denoted by , has as its vertices set with two distinct vertices and are adjacent if . The degree of the vertex of , denoted by , is the number of vertices adjacent to . The maximum (or minimum) degree matrix of is a square matrix whose -th entry is whenever and are adjacent, otherwise, it is zero. This study presents the maximum and minimum degree energies of for dihedral groups of order , by using the absolute eigenvalues of the corresponding maximum degree matrices ( ) and minimum degree matrices ( ).Here, the comparison of maximum and minimum degree energy of for is discussed by considering odd and even cases. The result shows that for each case, both energies are non-negative even integers and always equal. Penerbit UKM 2022 Article PeerReviewed Romdhini, Mamika Ujianita and Nawawi, Athirah (2022) Maximum and minimum degree energy of commuting graph for dihedral groups. Sains Malaysiana, 51 (12). pp. 4145-4151. ISSN 0126-6039 https://www.ukm.my/jsm/english_journals/vol51num12_2022/vol51num12_2022pg4145-4151.html 10.17576/jsm-2022-5112-21 |
| spellingShingle | Romdhini, Mamika Ujianita Nawawi, Athirah Maximum and minimum degree energy of commuting graph for dihedral groups |
| title | Maximum and minimum degree energy of commuting graph for dihedral groups |
| title_full | Maximum and minimum degree energy of commuting graph for dihedral groups |
| title_fullStr | Maximum and minimum degree energy of commuting graph for dihedral groups |
| title_full_unstemmed | Maximum and minimum degree energy of commuting graph for dihedral groups |
| title_short | Maximum and minimum degree energy of commuting graph for dihedral groups |
| title_sort | maximum and minimum degree energy of commuting graph for dihedral groups |
| work_keys_str_mv | AT romdhinimamikaujianita maximumandminimumdegreeenergyofcommutinggraphfordihedralgroups AT nawawiathirah maximumandminimumdegreeenergyofcommutinggraphfordihedralgroups |