A bound for the complexity of a simple graph
From MaRDI portal
Recommendations
- On a certain complexity estimate in graph theory
- The complexity of finite graphs
- The linear complexity of a graph
- The linear complexity of a graph
- A complexity problem for Borel graphs
- On Graph Complexity
- scientific article; zbMATH DE number 219271
- scientific article; zbMATH DE number 3876594
- scientific article; zbMATH DE number 3874609
- scientific article; zbMATH DE number 3874608
Cites work
Cited in
(18)- Upper bounds for the number of spanning trees of graphs
- Simple graph density inequalities with no sum of squares proofs
- On family of graphs with minimum number of spanning trees
- Spanning trees: A survey
- The number of bounded‐degree spanning trees
- Tree and forest weights and their application to nonuniform random graphs
- The number of spanning trees of a graph
- On the form factor for the unitary group
- On the geometry and Laplacian of a graph
- The number of spanning trees of a graph with given matching number
- A Survey of the Algorithmic Properties of Simplicial, Upper Bound and Middle Graphs
- Applications of multlinear algebra
- Graph complexity and the laplacian matrix in blocked experiments
- The maximum number of spanning trees of a graph with given matching number
- Sharp upper bounds for the number of spanning trees of a graph
- On the likelihood of forests
- A sharp upper bound for the number of spanning trees of a graph
- The minimum number of spanning trees in regular multigraphs
This page was built for publication: A bound for the complexity of a simple graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1102975)
