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.

Return the undirected graph obtained from the tree nodes and edges, with leaves being ignored.

Return the result of right rotation applied to a binary tree.
Right rotation on binary trees is defined as follows: Let $T$ be a binary tree such that the left child of the root of $T$ is a node. Let $C$ be the right child of the root of $T$, and let $A$ and $B$ be the left and right children of the left child of the root of $T$. (Keep in mind that nodes of trees are identified with the subtrees consisting of their descendants.) Then, the right rotation of $T$ is the binary tree in which the left child of the root is $A$, whereas the right child of the root is a node whose left and right children are $B$ and $C$.

Sends a permutation to its associated increasing tree.
This tree is recursively obtained by sending the unique permutation of length $0$ to the empty tree, and sending a permutation $\sigma$ of length $n \geq 1$ to a root node with two subtrees $L$ and $R$ by splitting $\sigma$ at the index $\sigma^{-1}(1)$, normalizing both sides again to permutations and sending the permutations on the left and on the right of $\sigma^{-1}(1)$ to the trees $L$ and $R$, respectively.