Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Counting spanning trees on fractal graphs and their asymptotic
  complexity   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 in Theorem \ref{thm:maintheoremfull}. We show how
spectral decimation implies the existence of the asymptotic complexity constant
and obtain some bounds for it. Examples calculated include the Sierpinski
Gasket, a non post critically finite analog of the Sierpinski Gasket, the
Diamond fractal, and the Hexagasket. For each example, the asymptotic
complexity constant is found.

33
The categories of this paper are: plasm-ph
36
The categories of this paper are: cmp-lg
23
The categories of this paper are: solv-int
31
The categories of this paper are: ao-sci
19
The categories of this paper are: eess
20
The categories of this paper are: acc-phys
3
The categories of this paper are: physics
8
The categories of this paper are: hep-ex
15
The categories of this paper are: nucl-ex
24
The categories of this paper are: dg-ga
34
The categories of this paper are: chem-ph
21
The categories of this paper are: adap-org
16
The categories of this paper are: stat
27
The categories of this paper are: comp-gas
30
The categories of this paper are: q-alg
11
The categories of this paper are: hep-lat