A Proof of Tuite’s Trinity Theorem and a New Determinant Formula

DOI10.1137/0601009zbMath0507.05055OpenAlexW2016631456MaRDI QIDQ4744301

Kenneth A. Berman

Publication date: 1980

Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0601009

zbMATH Keywords

determinantalternating dimapnumber of spanning arborescences of a digraph

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30) Graph theory (05C99)

Related Items

Growth rates of groups associated with face 2-coloured triangulations and directed Eulerian digraphs on the sphere ⋮ Balanced vertex weightings and arborescences ⋮ A version of Tutte's polynomial for hypergraphs ⋮ Binary functions, degeneracy, and alternating dimaps

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The dissection of rectangles into squares
• Matrix Generalizations of Some Theorems on Trees, Cycles and Cocycles in Graphs
• A NOTE ON THE ENUMERATION AND LISTING OF ALL POSSIBLE TREES IN A CONNECTED LINEAR GRAPH

This page was built for publication: A Proof of Tuite’s Trinity Theorem and a New Determinant Formula