Weighted spanning trees on some self-similar graphs

Details Weighted spanning trees on some self-similar graphs Weighted spanning trees on some self-similar graphs

2010-06-30

arxiv.org/abs/1007.0021v1

Mathematics

Combinatorics

21 pages

Scientific paper

We compute the complexity of two infinite families of finite graphs: the Sierpi\'{n}ski graphs, which are finite approximations of the well-known Sierpi\'nsky gasket, and the Schreier graphs of the Hanoi Towers group $H^{(3)}$ acting on the rooted ternary tree. For both of them, we study the weighted generating functions of the spanning trees, associated with several natural labellings of the edge sets.

Affiliated with

Also associated with

No associations

Rating

Weighted spanning trees on some self-similar graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Weighted spanning trees on some self-similar graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Weighted spanning trees on some self-similar graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-428077