Counting trees in directed regular multigraphs

DOI10.1016/0016-0032(89)90011-2zbMath0723.05071OpenAlexW2066285211WikidataQ57360168 ScholiaQ57360168MaRDI QIDQ757413

Michael R. Fellows, Jacek M. Wojciechowski

Publication date: 1989

Published in: Journal of the Franklin Institute (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0016-0032(89)90011-2

zbMATH Keywords

regular multigraphsdirected treesCayley multigraphscounting spanning trees

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (2)

Heuristic maximization of the number of spanning trees in regular graphs ⋮ On the number of spanning trees in directed circulant graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On generic forms of complementary graphs
• Counting spanning trees in the graphs of Kleitman and Golden and a generalization
• Tree counting polynomials for labelled graphs. I: Properties
• Spectra of Cayley graphs
• Parallel concepts in graph theory
• On the number of spanning trees of circulant graphs
• Counting Trees in a Certain Class of Graphs
• Graphs with circulant adjacency matrices
• A new 5‐arc‐transitive cubic graph

This page was built for publication: Counting trees in directed regular multigraphs