Search

Let S(G) be the Seidel matrix of a graph G. The Seidel energy of G, denoted by ES(G), is defined to be the sum of absolute values of all eigenvalues of the Seidel matrix S(G) of G. In this paper, we consider the change of Seidel energy of graphs due to edge deletion. It is proved that the Seidel energy of the tripartite Turán graph T(n, 3) of order n ≥ 9 is always increased when an edge is deleted. [ABSTRACT FROM AUTHOR]

For two graphs G and H, the corona product G ∘ H is the graph obtained by taking one copy of G and | V G | copies of H, and joining the ith vertex of G with every vertex of the ith copy of H. In this paper, we study the state transfer of corona relative to the signless Laplacian matrix. We explore some conditions that guarantee the signless Laplacian perfect state transfer in G ∘ H . We prove that G ∘ K m has no signless Laplacian perfect state transfer for some special m. We also show that K 2 ∘ H has pretty good state transfer but no perfect state transfer relative to the signless Laplacian matrix for a regular graph H. Furthermore, we show that n K 2 ¯ ∘ K 1 has signless Laplacian pretty good state transfer, where n K 2 ¯ is the cocktail party graph. [ABSTRACT FROM AUTHOR]