On graphs whose reduced energy does not exceed 3.
On the Laplacian energy of a graph
In this paper we consider the energy of a simple graph with respect to its Laplacian eigenvalues, and prove some basic properties of this energy. In particular, we find the minimal value of this energy in the class of all connected graphs on vertices . Besides, we consider the class of all connected graphs whose Laplacian energy is uniformly bounded by a constant , and completely describe this class in the case .
Maximal Canonical Graphs with Seven Nonzero Eigenvalues
A PROLOG program for analysis and synthesis of typical sentences taken from advertisements
Formal grammar for a fragment of the Serbian language
Page 1