Research problems

DOI10.1016/0012-365X(90)90140-DMaRDI QIDQ5895285zbMATH OpenOpenAlexFDO

Authors Dino Lorenzini

Publication date 1990

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365x(90)90140-d

zbMATH Keywords

Betti numbernumber of spanning trees

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Trees (05C05) Enumeration in graph theory (05C30)

Review text

Two problems are given: Problem 130. (D. J. Lorenzini): on the Betti number and the number of spanning trees. Problem 131. (D. J. Lorenzini), bound on the number of spanning trees.

Recommendations

• Euler's idoneal numbers and an inequality concerning minimal graphs with a prescribed number of spanning trees.
• scientific article; zbMATH DE number 1484041
• A lower bound on solutions of Chartrand's problem
• The number of spanning trees of double graphs
• The number of spanning forests of a graph

Cited in

(1)

• Arithmetical properties of laplacians of graphs

This page was built for publication: Research problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5895285)