JOURNAL ARTICLE

Distance energy change of complete split graph due to edge deletion.

  • Published In: Discrete Mathematics, Algorithms & Applications, 2024, v. 16, n. 3. P. 1 1 of 3

  • Database: Academic Search Ultimate 2 of 3

  • Authored By: Banerjee, Subarsha 3 of 3

Abstract

The distance energy of a connected graph G is the sum of absolute values of the eigenvalues of the distance matrix of G. In this paper, we study how the distance energy of the complete split graph G S (m , n) = K m + K ¯ n changes when an edge is deleted from it. The complete split graph G S (m , n) consists of a clique on m vertices and an independent set on n vertices in which each vertex of the clique is adjacent to each vertex of the independent set. We prove that the distance energy of the complete split graph G S (m , n) always increases when an edge is deleted from it. [ABSTRACT FROM AUTHOR]

Additional Information

  • Source:Discrete Mathematics, Algorithms & Applications. 2024/04, Vol. 16, Issue 3, p1
  • Document Type:Article
  • Subject Area:Science
  • Publication Date:2024
  • ISSN:1793-8309
  • DOI:10.1142/S1793830923500337
  • Accession Number:175283992
  • Copyright Statement:Copyright of Discrete Mathematics, Algorithms & Applications is the property of World Scientific Publishing Company and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Looking to go deeper into this topic? Look for more articles on EBSCOhost.