On incidence energy of graphs.

Abstract: Let be a simple graph with vertex set and edge set . The incidence matrix of G is the matrix whose -entry is 1 if is incident to and 0 otherwise. The incidence energy IE of G is the sum of the singular values of . In this paper we give lower and upper bounds for IE in terms of n, m, maximum degree, clique number, independence number, and the first Zagreb index. Moreover, we obtain Nordhaus–Gaddum-type results for IE. [Copyright &y& Elsevier]