scientific article; zbMATH DE number 3987294
From MaRDI portal
Publication:3751591
Recommendations
Cited in
(13)- A lower bound on solutions of Chartrand's problem
- On the number of spanning trees of some irregular line graphs
- Undirected simple connected graphs with minimum number of spanning trees
- Express the number of spanning trees in term of degrees
- On the edge degrees of trees
- On family of graphs with minimum number of spanning trees
- scientific article; zbMATH DE number 4112610 (Why is no real title available?)
- scientific article; zbMATH DE number 3989380 (Why is no real title available?)
- Graphs with not too many spanning trees
- Properties related to the function of the number of undirected non-isomorphic trees
- Enumeration of spanning trees of middle graphs
- scientific article; zbMATH DE number 146435 (Why is no real title available?)
- Expression for the number of spanning trees of line graphs of arbitrary connected graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3751591)