S-trees

Authors Daniel A. Jaume, Gonzalo Molina, Rodrigo Sota

Publication date 12 September 2017

Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

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 page was built for publication: S-trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6291189)