Hostname: page-component-74656f9884-c52kr Total loading time: 0 Render date: 2026-11-09T06:47:58.864Z Has data issue: false hasContentIssue false

COMB GRAPHS AND SPECTRAL DECIMATION

Published online by Cambridge University Press:  01 January 2009

JONATHAN JORDAN*
Affiliation:
Department of Probability and Statistics, University of Sheffield, Hounsfield Road, Sheffield S3 7RH, UK e-mail: jonathan.jordan@shef.ac.uk
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

We investigate the spectral properties of matrices associated with comb graphs. We show that the adjacency matrices and adjacency matrix Laplacians of the sequences of graphs show a spectral similarity relationship in the sense of work by L. Malozemov and A. Teplyaev (Self-similarity, operators and dynamics, Math. Phys. Anal. Geometry6 (2003), 201–218), and hence these sequences of graphs show a spectral decimation property similar to that of the Laplacians of the Sierpiński gasket graph and other fractal graphs.

Information

Type
Research Article
Copyright
Copyright © Glasgow Mathematical Journal Trust 2008