Lower bound for the norm of a vertex-transitive graph

DOI10.1007/BF03025720zbMath0798.05036OpenAlexW2002646003MaRDI QIDQ1319328

William L. Paschke

Publication date: 20 October 1994

Published in: Mathematische Zeitschrift (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/174528

zbMATH Keywords

spectral radiusCayley graphsadjacency matrixinfinite graphlinear operatorvertex-transitive graphadjacency operatorvalency

Mathematics Subject Classification ID

Norms (inequalities, more than one norm, etc.) of linear operators (47A30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph theory (05C99)

Related Items (9)

Spectral radius of finite and infinite planar graphs and of graphs of bounded genus ⋮ Line-graph lattices: Euclidean and non-Euclidean flat bands, and implementations in circuit quantum electrodynamics ⋮ Amenability of Groups and G-Sets ⋮ Kesten's theorem for invariant random subgroups. ⋮ On problems related to growth, entropy, and spectrum in group theory ⋮ A characterization of the Leinert property ⋮ A strengthening and a multipartite generalization of the Alon-Boppana-Serre theorem ⋮ The measurable Kesten theorem ⋮ Not every uniform tree covers Ramanujan graphs

Cites Work

• Amenability, unimodularity, and the spectral radius of random walks on infinite graphs
• Addition of certain non-commuting random variables
• Cogrowth and amenability of discrete groups
• Noncommutative random variables and spectral problems in free product \(C^*\)-algebras
• Symmetric Random Walks on Groups
• A Survey on Spectra of infinite Graphs
• Cogrowth of Regular Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Lower bound for the norm of a vertex-transitive graph