Counting trees in directed regular multigraphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3138903 (Why is no real title available?)
- scientific article; zbMATH DE number 3717357 (Why is no real title available?)
- scientific article; zbMATH DE number 3783047 (Why is no real title available?)
- scientific article; zbMATH DE number 3552764 (Why is no real title available?)
- scientific article; zbMATH DE number 3336710 (Why is no real title available?)
- scientific article; zbMATH DE number 3340110 (Why is no real title available?)
- A new 5‐arc‐transitive cubic graph
- Counting Trees in a Certain Class of Graphs
- Counting spanning trees in the graphs of Kleitman and Golden and a generalization
- Graphs with circulant adjacency matrices
- On generic forms of complementary graphs
- On the number of spanning trees of circulant graphs
- Parallel concepts in graph theory
- Spectra of Cayley graphs
- Tree counting polynomials for labelled graphs. I: Properties
Cited in
(7)- scientific article; zbMATH DE number 409493 (Why is no real title available?)
- 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
- scientific article; zbMATH DE number 3966096 (Why is no real title available?)
- 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)