Search

Let G be a simple undirected graph. The Seidel energy of G , denoted by E s (G) , is the sum of absolute values of all Seidel eigenvalues of G. A complete r -partite graph with n vertices is called r -partite Turán graph, denoted by T (n , r) , if the number of vertices of each part is either ⌊ n r ⌋ or ⌈ n r ⌉. In 2021, Tian et al. proposed a problem that for any edge e of Turán graph T (n , r) with r ≥ 4 , does there exist a sufficiently large integer n 0 such that E s (T (n , r)) < E s (T (n , r) − e) whenever n ≥ n 0 . In this paper, we prove that the Seidel energy of T (n , 5) of order n ≥ 5 is always increased when an edge is deleted. [ABSTRACT FROM AUTHOR]