#### Filter Results:

- Full text PDF available (8)

#### Publication Year

2002

2015

- This year (0)
- Last 5 years (2)
- Last 10 years (9)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

The number of spanning trees of a graph, also known as the complexity, is investigated for graphs which are constructed by a replacement procedure yielding a self-similar structure. It is shown thatâ€¦ (More)

- Elmar Teufl
- Combinatorics, Probability & Computing
- 2003

We investigate the asymptotic behaviour of the average displacement of the simple random walk on the SierpiÅ„ski graph. The existence of an oscillating factor in this asymptotics is shown rigorously.â€¦ (More)

We define a pseudometric on the set of all unbounded subsets of a metric space. The Kolmogorov quotient of this pseudometric space is a complete metric space. The definition of the pseudometric isâ€¦ (More)

- Elmar Teufl, Stephan G. Wagner
- J. Comb. Theory, Ser. A
- 2007

We describe a general construction principle for a class of self-similar graphs. For various enumeration problems, we show that this construction leads to polynomial systems of recurrences andâ€¦ (More)

- Mario Lamberger, Elmar Teufl
- Inf. Process. Lett.
- 2013

Abstract. In this paper we discuss the problem of generically finding nearcollisions for cryptographic hash functions in a memoryless way. A common approach is to truncate several output bits of theâ€¦ (More)

- Elmar Teufl, Stephan G. Wagner
- Graphs and Combinatorics
- 2009

Let z(G) be the number of matchings (independent edge subsets) of a graph G. For a set M of edges and/or vertices, the ratio rG(M) = z(G \M)/z(G) represents the probability that a randomly pickedâ€¦ (More)

- Elmar Teufl, Stephan G. Wagner
- Discrete Mathematics & Theoretical Computerâ€¦
- 2009

We study two graph parameters, namely the number of spanning forests and the number of connected subgraphs, for self-similar graphs with exactly two boundary vertices. In both cases, we determine theâ€¦ (More)

This is a survey of topological, group theoretical and some graph theoretical aspects of ends. After discussing the notion of ends in topology, we consider ends of graphs and show that the metric endâ€¦ (More)

- Elmar Teufl, Stephan G. Wagner
- Discrete Applied Mathematics
- 2010

Abstract. The number of matchings of a graph G is an important graph parameter in various contexts, notably in statistical physics (dimer-monomer model). Following recent research on graph parametersâ€¦ (More)

- Erwin SchrÃ¶dinger International, Elmar Teufl
- 2002

The spectral dimension and the Hausdorff dimension of the SierpiÅ„ski gasket are known to be different. Kigami proved that the Hausdorff dimension dh with respect to the harmonic metric is less thanâ€¦ (More)