Sökning: "Spanning Tree Enumeration"

Hittade 1 uppsats innehållade orden Spanning Tree Enumeration.

  1. 1. Methods from Linear Algebra for the Enumeration of Spanning Trees

    Kandidat-uppsats, KTH/Skolan för teknikvetenskap (SCI)

    Författare :Nils Forsgren; [2023]
    Nyckelord :Spanning Tree Enumeration;

    Sammanfattning : In this report, we study the enumeration of spanning trees in graphs, using two methods withinlinear algebra, Kirchhoff’s Matrix Tree Theorem and an alternative method, also referred to asLemma 1, derived by S. Klee and M.T Stamps in [KS20]. LÄS MER