On the distance spectrum and distance energy of complement of subgroup graphs of dihedral group (rev)

Abdussakir, Abdussakir, Susanti, Elly ORCID: https://orcid.org/0000-0001-9528-4947, Turmudi, Turmudi, Jauhari, Mohammad Nafie ORCID: https://orcid.org/0000-0001-9528-4947 and Ulya, Nanda M. (2018) On the distance spectrum and distance energy of complement of subgroup graphs of dihedral group (rev). Presented at WMA: Applied Mathematics, Computer Science, Information Systems, and Information Technology, 19-20 Januari 2018, Banda Aceh.

Preview

Text 6936.pdf Available under License Creative Commons Attribution. Download (1MB) | Preview

Abstract

Let G is a connected simple graph and V(G) = {v1, v2, ..., vp} is vertex set of G. The distance matrix of G is a matrix D(G) = [dij] of order p where [dij] = d(vi, vj) is distance between vi and vj in G. The set of all eigenvalues of matrix D(G) together with their corresponding multiplicities is named the distance spectrum of G and denoted by specD(G). The distance energy of G is ${E}_{D}(G)={\sum }_{i=1}^{p}|{\lambda }_{i}|$, where λi are eigenvalues of D(G). In the recent paper, the distance spectrum and distance energy of complement of subgroup graphs of dihedral group are determined.

Item Type:	Conference (Paper)
Subjects:	01 MATHEMATICAL SCIENCES > 0101 Pure Mathematics > 010104 Combinatorics and Discrete Mathematics (excl. Physical Combinatorics)
Divisions:	Graduate Schools > Magister Programme > Graduate School of Mathematics Education
Depositing User:	Elly Susanti
Date Deposited:	19 Oct 2020 14:47

Downloads

Origin of downloads

Actions (login required)

View Item