The distance matrix of a bidirected tree
Main Article Content
Abstract
A bidirected tree is a tree in which each edge is replaced by two arcs in either direction. Formulas are obtained for the determinant and the inverse of a bidirected tree, generalizing well-known formulas in the literature.
Article Details
Issue
Section
Article