S-trees
Combinatorics
2017-09-13 v1
Abstract
In this paper two new graph operations are introduced, and with them the S-trees are studied in depth. This allows to find -basis for all the fundamental subspaces of the adjacency matrix of any tree, and to understand in detail the matching structure of any tree.
Keywords
Cite
@article{arxiv.1709.03865,
title = {S-trees},
author = {Daniel A. Jaume and Gonzalo Molina and Rodrigo Sota},
journal= {arXiv preprint arXiv:1709.03865},
year = {2017}
}
Comments
26 pages, 9 figures