Counting trees in directed regular multigraphs

DOI10.1016/0016-0032(89)90011-2zbMATH Open0723.05071OpenAlexW2066285211WikidataQ57360168 ScholiaQ57360168MaRDI QIDQ757413FDOQ757413

Michael R. Fellows, Jacek 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

directed treesCayley multigraphscounting spanning treesregular multigraphs

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Spectra of Cayley graphs
• Parallel concepts in graph theory
• Graphs with circulant adjacency matrices
• A new 5‐arc‐transitive cubic graph
• On the number of spanning trees of circulant graphs
• 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
• Counting Trees in a Certain Class of Graphs

Cited In (4)

• Title not available (Why is that?)
• Heuristic maximization of the number of spanning trees in regular graphs
• On the number of spanning trees in directed circulant graphs
• On the tree number of regular graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q757413)