On Incidence Energy of Some Graphs

Abstract

Let \(G\) be a simple graph. The incidence energy ( \(IE\) for short ) of \(G\) is defined as the sum of the singular values of the incidence matrix. In this paper, a new lower bound for \(IE\) of graphs in terms of the maximum degree is given. Meanwhile, an upper bound and a lower bound for \(IE\) of the subdivision graph and the total graph of a regular graph \(G\) are obtained, respectively.