Sains Malaysiana 51(12)(2022): 4145-4151

http://doi.org/10.17576/jsm-2022-5112-21

 

Maximum and Minimum Degree Energy of Commuting Graph for Dihedral Groups

(Tenaga Darjah Maksimum dan Minimum bagi Graf Kalis Tukar Tertib bagi Kumpulan Dwihedron)

 

MAMIKA UJIANITA ROMDHINI1,3 & ATHIRAH NAWAWI1,2*

1Department of Mathematics and Statistics, Faculty of Science, Universiti Putra Malaysia, 43400 UPM Serdang, Selangor Darul Ehsan, Malaysia
2Institute for Mathematical Research, Universiti Putra Malaysia, 43400 UPM Serdang, Selangor Darul Ehsan, Malaysia

3Department of Mathematics, Faculty of Mathematics and Natural Science, Universitas Mataram, 83125, Indonesia

 

Diserahkan: 14 April 2022/Diterima: 29 Ogos 2022

 

Abstract

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.

 

Keywords: Commuting graph; degree of vertex; dihedral group; energy of a graph

                                                                                          

Abstrak

Jika  adalah suatu kumpulan terhingga dan  adalah pusat bagi , maka graf kalis tukar tertib bagi , ditatatandakan dengan , mempunyai sebagai set bucunya dengan dua bucu berbeza  dan  adalah bersebelahan jika . Darjah bucu  dalam , ditatatandakan dengan , adalah bilangan bucu bersebelahan dengan . Matriks darjah maksimum (atau minimum) bagi  ialah matriks segiempat sama yang mana unsur ke-  adalah    apabila  dan  bersebelahan, jika tidak, ia adalah sifar. Kajian ini mengemukakan tenaga darjah maksimum dan minimum  bagi kumpulan dwihedron berperingkat ,  dengan menggunakan nilai eigen mutlak bagi matriks darjah maksimum ( ) dan matriks darjah minimum ( ) yang sepadan. Di sini, perbandingan tenaga darjah maksimum dan minimum  bagi  dibincangkan dengan mempertimbangkan kes   ganjil dan genap. Hasilnya menunjukkan bahawa bagi setiap kes, kedua-dua tenaga adalah integer genap bukan negatif dan sentiasa sama.

 

Kata kunci: Darjah bucu; graf kalis tukar tertib; kumpulan dwihedron; tenaga graf

 

RUJUKAN

Abdussakir, Akhadiyah, D.A., Layali, A. & Putra, A.T. 2019. The adjacency spectrum of subgroup graphs of dihedral group. IOP Conf. Ser. Earth Environ. Sci. 243(1): 1-10.

Adiga, C. & Swamy, S. 2010. Bounds on the largest of minimum degree eigenvalues of graphs. Int. Math. Forum 5(37): 1823-1831.

Adiga, C. & Smitha, M. 2009. On maximum degree energy of a graph. Int. J. Contemp. Math. Sciences 4(8): 385-396.

Aschbacher, M. 2000. Finite Group Theory. Cambridge: University Press. pp. 1-6.

Brauer, R. & Fowler, K.A. 1955. On groups of even order. Ann. Math. 62: 565-583.

Bundy, D. 2006. The connectivity of commuting graphs. J. Combin. Theory Ser. A 113(6): 995-1007.

Brouwer, A.E. & Haemers, W.H. 2011. Spectra of Graphs. New York: Springer-Verlag. pp. 1-19.

Gantmacher, F.R. 1959. The Theory of Matrices. New York: Chelsea Publishing Company. pp. 23-49.

Gheisari, Y. & Ahmad, A.G. 2012. Components in graphs of diagram groups over the union of two semigroup presentations of integers. Sains Malaysiana41(1): 129-131.

Gutman, I. 1978. The energy of graph.  Ber. Math. Statist. Sekt. Forschungszenturm Graz 103: 1-22.

Hosamani, S.M., Kulkarni, B.B., Boli, R.G. & Gadag, V.M. 2017. QSPR analysis of certain graph theocratical matrices and their corresponding energy. Appl. Math. Nonlinear Sci. 2(1): 131-150.

Kasim, S.M. & Nawawi, A. 2021. On diameter of subgraphs of commuting graph in symplectic group for elements of order three. Sains Malaysiana 50(2): 549-557.

Kasim, S.M. & Nawawi, A. 2018. On the energy of commuting graph in symplectic group. AIP Conf. Proc. 1974(1): 030022.

Loh, S.L., Salleh, S. & Sarmin, N.H. 2014. Linear-time heuristic partitioning technique for mapping of connected graphs into single-row networks. Sains Malaysiana43(8): 1263-1269.

Nawawi, A. 2013. Commuting graphs for elements of order three in finite groups. University of Manchester. Ph.D. Thesis (Unpublished).

Nawawi, A. & Rowley, P. 2015. On commuting graphs for elements of order 3 in symmetric groups. Elec. J. Comb. 22(1): P1.21.

Nawawi, A., Husain, S.K.S. & Ariffin, M.R.K. 2019. Commuting graphs , in symmetric groups and its connectivity. Symmetry 11(9): 1178.

Ramane, H.S. & Shinde, S.S. 2017. Degree exponent polynomial of graphs obtained by some graph operations. Electron. Notes Discrete Math. 63: 161-168.

Razak, F.A. & Expert, P. 2021. Modelling the spread of COVID-19 on Malaysian contact networks for practical reopening strategies in an institutional setting. Sains Malaysiana 50(5): 1497-1509.

Romdhini, M.U. & Nawawi, A. 2022. Degree sum energy of non-commuting graph for dihedral groups. Malaysian J. Sci. 41(sp1): 34-39. https: //doi.org/10.22452/msj.sp2022no.1.5

Romdhini, M.U., Nawawi, A. & Chen, C.Y. 2022. Degree exponent sum energy of commuting graph for dihedral groups. Malaysian J. Sci. 41(1): 40-46.

Trinajstic, N. 1992. Chemical Graph Theory. Boca Raton: CRC Press.

Wang, Y-F. & Ma, N. 2016. Orderings a class of unicyclic graphs with respect to Hosoya and Merrifield-Simmons Index. Sains Malaysiana 45(1): 55-58.

 

*Pengarang untuk surat-menyurat; email: athirah@upm.edu.my

 

 

 

   

sebelumnya