Abstract: Let G denote a  simple undirected connected graph.The Nirmala energy of a graph is equal to the sum of the absolute values of the eigenvalues of Nirmala matrix.In this paper,using mathematical analysis and inequality methods,we obtain some new upper bounds for the Nirmala energy of graphs.

Key words: graph, Nirmala matrix, Nirmala energy, upper bound