Lower bound for the norm of a vertex-transitive graph (Q1319328): Difference between revisions

Let \(G= (V,E)\) be an infinite \(d\)-regular graph. The adjacency matrix of \(G\) defines a linear operator \(A\) on \(\ell^ 2(V)\) with norm \(\rho(G)= \| A\|\leq d\). This paper extends some results (nicely exposed in Sections 4.30-4.32 of \textit{A. L. T. Paterson} [Amenability, Mathematical Surveys and Monographs 29 (1988; Zbl 0648.43001)]) about norms of Cayley graphs to the more general case of vertex-transitive graphs. In particular, a computable function \(F(k,d)> 2(d- 1)^{1/2}\) is given such that every infinite vertex-transitive graph \(G\) of valency \(d\) and with a cycle of length \(k\) has norm \(\rho(G)\) bounded below by \(F(k,d)\).