Counting trees in directed regular multigraphs
type: Item
instance of: scholarly article
title: Counting trees in directed regular multigraphs
zbMATH Open document ID: 0723.05071
DOI: 10.1016/0016-0032(89)90011-2
author: Jacek Wojciechowski
author: Michael R. Fellows
published in: Journal of the Franklin Institute
publication date: 1989-01-01T00:00:00Z
Mathematics Subject Classification ID: 05C30
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C50
zbMATH DE Number: 4191700
zbMATH Keywords: counting spanning trees
zbMATH Keywords: regular multigraphs
zbMATH Keywords: directed trees
zbMATH Keywords: Cayley multigraphs
Wikidata QID: Q57360168
MaRDI profile type: Publication
full work available at URL: 0016-0032(89)90011-2
OpenAlex ID: W2066285211
cites work: A new 5‐arc‐transitive cubic graph
cites work: Q3907599
cites work: Tree counting polynomials for labelled graphs. I: Properties
cites work: On generic forms of complementary graphs
cites work: Q5616724
cites work: Spectra of Cayley graphs
cites work: Parallel concepts in graph theory
cites work: Graphs with circulant adjacency matrices
cites work: Q3960731
cites work: Q3254327
cites work: Q4126536
cites work: On the number of spanning trees of circulant graphs
cites work: Counting Trees in a Certain Class of Graphs
cites work: Counting spanning trees in the graphs of Kleitman and Golden and a generalization
cites work: Q5613844
description: scientific article; zbMATH DE number 4191700