Back to search

Cornell University

Counting Spanning Trees On Fractal Graphs

Abstract

dc:description.abstract

Using the method of spectral 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 non-p.c.f. analog of the Sierpinski Gasket, the Diamond fractal, and the Hexagasket. For each example, the asymptotic complexity constant is found. Dropping the fully symmetry assumption, it is shown that the limsup and liminf of the asymptotic complexity constant exist. Calculating the number of spanning trees on the m-Tree fractal shows that the asymptotic complexity constant for this class of fractals has no upper bound.

Degree

thesis:*
Name thesis:degree_name
Ph. D., Mathematics
Level thesis:degree_level
Doctor of Philosophy
Discipline thesis:degree_discipline
Mathematics
Grantor
Cornell University
Year dc:date.issued
2012

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Anema, Jason
Chair dc:contributor.chair
  • Strichartz, Robert Stephen
Committee members dc:contributor.committeemember
  • Muscalu, Florin Camil
  • Saloff-Coste, Laurent Pascal

Subjects

dc:subject × 3

Rights

Language dc:language.iso
en_US

Identifiers

dc:identifier.*
Dc Identifier Bibid
7959772

Chain of custody

source
Harvested from
Cornell University
Base URL
ecommons.cornell.edu/server/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Anema, Jason. Counting Spanning Trees On Fractal Graphs. Doctor of Philosophy thesis, Cornell University, 2012. https://hdl.handle.net/1813/31048