The energy of a graph, if it is integral.
The energy of a graph is the sum of the absolute values of its eigenvalues. This statistic is only defined for graphs with integral energy. It is known, that the energy is never an odd integer [2]. In fact, it is never the square root of an odd integer [3].
The energy of a graph is the sum of the energies of the connected components of a graph. The energy of the complete graph $K_n$ equals $2n-2$. For this reason, we do not define the energy of the empty graph.

Sends a Dyck path to the ordered tree encoding the heights of the path.
This map is recursively defined as follows: A Dyck path $D$ of semilength $n$ may be decomposed, according to its returns (St000011The number of touch points (or returns) of a Dyck path.), into smaller paths $D_1,\dots,D_k$ of respective semilengths $n_1,\dots,n_k$ (so one has $n = n_1 + \dots n_k$) each of which has no returns.
Denote by $\tilde D_i$ the path of semilength $n_i-1$ obtained from $D_i$ by removing the initial up- and the final down-step.
This map then sends $D$ to the tree $T$ having a root note with ordered children $T_1,\dots,T_k$ which are again ordered trees computed from $D_1,\dots,D_k$ respectively.
The unique path of semilength $1$ is sent to the tree consisting of a single node.

The Dyck path determined by the last diagonal of the monotone triangle of an alternating sign matrix.

Return the undirected graph obtained from the tree nodes and edges.