Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 11 of 11 for “"Matrix-tree theorem"”.

  1. A New Interpretation of the Matrix Tree Theorem Using Weak Walk Contributions and Circle Activation

    This thesis provides an alternate proof of the Matrix Tree Theorem by shifting the focus to oriented incidences. We examine the weak walk contributors from the de-terminant of the Laplacian matrix of oriented graphs and classify them according to similar circle structures attained through circle …

    texas-state Repository record for A New Interpretation of the Matrix Tree Theorem Using Weak Walk Contributions and Circle Activation (opens in a new tab)

  2. Total Minor Polynomials of Oriented Hypergraphs

    … generalization of Seth Chaiken’s All-Minors Matrix-Tree Theorem and Sachs’ Coefficient Theorem to all integer adjacency and Laplacian matrices – extending the results of Rusnak, Robinson et. al. – by introducing a polynomial in |V|2 indeterminants indexed by minor order whose monomial …

    texas-state Repository record for Total Minor Polynomials of Oriented Hypergraphs (opens in a new tab)

  3. Counting Spanning Trees On Fractal Graphs

    … decimation and a modified version of Kirchhoff's Matrix-Tree Theorem, a closed form solution to the number of spanning trees on approximating graphs to a fully symmetric self-similar structure on ´ a finitely ramified fractal is given. Examples calculated include the Sierpinski ´ Gasket, a …

    cornell Repository record for Counting Spanning Trees On Fractal Graphs (opens in a new tab)

  4. Hyperpfaffians in Algebraic Combinatorics

    … Following this we examine the extension of the Matrix-Tree theorem to the Hyperpfaffian-Cactus theorem by Abdesselam, proving it without the use of the Grassman-Berezin Calculus and with the new terminology of the non-uniform hyperpfaffian. Next we look at the extension of pfaffian orientations …

    waterloo Repository record for Hyperpfaffians in Algebraic Combinatorics (opens in a new tab)

  5. Enumerating spanning trees

    … Cayley stated his well-known and widely used theorem that there are n° - 2 trees on n labeled vertices [6, p. 70]. Since he originally stated it, the theorem has received much attention: people have proved it in many different ways. In this paper we consider three of these proofs. The first is …

    ut-knoxville Repository record for Enumerating spanning trees (opens in a new tab)

  6. Ant colony optimization and rectilinear Steiner minimal trees

    … we introduce the Rectilinear Steiner Minimal Tree (RSMT) problem and describe the Ant Colony algorithm which we use to construct the RSMT. The development of an Ant Colony algorithm called AntCol Steiner is described and we create a working program of the algorithm using the Sun Microsystems …

    ubc Repository record for Ant colony optimization and rectilinear Steiner minimal trees (opens in a new tab) Download PDF for Ant colony optimization and rectilinear Steiner minimal trees (opens in a new tab)

  7. Geometric bijections of graphs and regular matroids​

    … by researchers from various areas. By the Matrix-Tree Theorem, the cardinality of the Jacobian is equal to the number of spanning trees of a graph. In this dissertation, we study several topics centered on a new family of bijections, named the geometric bijections, between the Jacobian and …

    gatech Repository record for Geometric bijections of graphs and regular matroids​ (opens in a new tab)

  8. Properties and Recent Applications in Spectral Graph Theory

    … of graphs, such as the walks and the adjacency matrix are explored. In addition, bipartite graphs are discussed along with properties that apply strictly to bipartite graphs. The main focus is on the characteristic polynomial and the eigenvalues that it produces, because most of the applications …

    vcu Repository record for Properties and Recent Applications in Spectral Graph Theory (opens in a new tab)

  9. Homological tools, intersection theory, and tropical abelian varieties

    … νϑ over the effective loci Wd recovers Foster’s theorem and Kirchhoff’s matrix-tree theorem as special cases. We also give an alternative proof of the tropical Poincaré formula. Second, we study the tropical Ceresa cycle W1 - W1- in Jac(Γ). We define a graph invariant α(G) called the Ceresa …

    washington Repository record for Homological tools, intersection theory, and tropical abelian varieties (opens in a new tab)

  10. Forest Generating Functions of Directed Graphs

    … associating them with a generalized Laplacian matrix and studying its properties. We introduce a novel proof of the famous matrix-tree theorem and show how this extends to a parametric generalization of the all-minors matrix-forest theorem. As an application, we derive explicit formulas for the …

    portland-state Repository record for Forest Generating Functions of Directed Graphs (opens in a new tab)

  11. Stability and Spectral Properties in the Max Algebra with Applications in Ranking Schemes

    … matrices. We see that many well-known theorems in this context extend to the max algebra. We also consider how we can relate these results to ranking applications in decision making problems. In particular, we focus on deriving ranking schemes for the Analytic Hierarchy Process (AHP). …

    maynooth Download PDF for Stability and Spectral Properties in the Max Algebra with Applications in Ranking Schemes (opens in a new tab)