Enumeration of spanning trees of middle digraphs
From MaRDI portal
Publication:6042729
Recommendations
Cites work
- scientific article; zbMATH DE number 3747159 (Why is no real title available?)
- scientific article; zbMATH DE number 3445271 (Why is no real title available?)
- A combinatorial Laplacian with vertex weights
- Combinatorial matrix theory
- Enumeration of spanning trees of middle graphs
- Graph theory
- Line-digraphs, arborescences and theorems of Tutte and Knuth
- New proofs for Levine's theorems
- On the normalised Laplacian spectrum, degree-Kirchhoff index and spanning trees of graphs
- Sandpile groups and spanning trees of directed line graphs
- The enumeration of spanning tree of weighted graphs
- The properties of middle digraphs.
- Transformations of digraphs viewed as intersection digraphs
- Zeta functions and complexities of middle graphs of semiregular bipartite graphs
Cited in
(3)
This page was built for publication: Enumeration of spanning trees of middle digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6042729)