Counting trees in directed regular multigraphs
From MaRDI portal
DOI10.1016/0016-0032(89)90011-2zbMATH Open0723.05071OpenAlexW2066285211WikidataQ57360168 ScholiaQ57360168MaRDI QIDQ757413FDOQ757413
Authors: Jacek Wojciechowski, Michael R. Fellows 
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
Recommendations
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?)
- Spectra of Cayley graphs
- Parallel concepts in graph theory
- Graphs with circulant adjacency matrices
- A new 5‐arc‐transitive cubic graph
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
Cited In (7)
- Title not available (Why is that?)
- The number of spanning trees of the regular networks
- Heuristic maximization of the number of spanning trees in regular graphs
- On the number of spanning trees in directed circulant graphs
- Title not available (Why is that?)
- On the tree number of regular graphs
- Oriented spanning trees and stationary distribution of digraphs
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)
