Back to Search Start Over

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

Authors :
Banerjee, Subarsha
Source :
Discrete Mathematics, Algorithms & Applications; Apr2024, Vol. 16 Issue 3, p1-11, 11p
Publication Year :
2024

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]

Details

Language :
English
ISSN :
17938309
Volume :
16
Issue :
3
Database :
Complementary Index
Journal :
Discrete Mathematics, Algorithms & Applications
Publication Type :
Academic Journal
Accession number :
175283992
Full Text :
https://doi.org/10.1142/S1793830923500337