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.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have