Title: Counting spanning trees in directed regular multigraphs
Abstract: The problem of counting spanning trees in regular multigraphs is considered. The emphasis is on the case of directed trees. It is shown that the numbers of spanning in-trees and out-trees with respect to any point of a regular multigraph are the same. A general formula for counting directed spanning trees with the use of graph eigenvalues is introduced. Formulae for computing eigenvalues of Cayley multigraphs are presented.
Publication Year: 1989
Publication Date: 1989-01-01
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 5
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot