English

The energy change of the complete multipartite graph

Combinatorics 2017-11-15 v1

Abstract

The energy of a graph is defined as the sum of the absolute values of all eigenvalues of the graph. Akbari et al. \cite{S. Akbari} proved that for a complete multipartite graph Kt1,,tkK_{t_1 ,\ldots,t_k}, if ti2 (i=1,,k)t_i\geq 2 \ (i=1,\ldots,k), then deleting any edge will increase the energy. A natural question is how the energy changes when min{t1,,tk}=1\min\{t_1 ,\ldots,t_k\}=1. In this paper, we will answer this question and completely determine how the energy of a complete multipartite graph changes when one edge is removed.

Keywords

Cite

@article{arxiv.1711.04095,
  title  = {The energy change of the complete multipartite graph},
  author = {Hai-Ying Shan and Chang-Xiang He and Zhen-Sheng Yu},
  journal= {arXiv preprint arXiv:1711.04095},
  year   = {2017}
}