  In this paper two new graph operations are introduced, and with them the
S-trees are studied in depth. This allows to find \(\{-1,0,1\}\)-basis for all
the fundamental subspaces of the adjacency matrix of any tree, and to
understand in detail the matching structure of any tree.
