Bent functions are a class of discrete functions which exhibit the highest degree of nonlinearity. As such bent functions form an essential part of cryptographic systems. Original concept of bent functions defined in GF(2) can be extended to multiple-valued case. Multiple-valued bent functions are defined in therms of properties of their Vilenkin-Chrestenson spectra. Decision diagrams are a method of compact representation of discrete functions. Special types of decision diagrams have been introduced for various types of discrete functions. In this paper we demonstrate how Vilenkin-Chrestenson decision diagrams can be used for efficient representation of multiple-valued bent functions.