S-trees
classification
🧮 math.CO
keywords
s-treestreeadjacencyallowsbasisdepthdetailfind
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.