Lower bound for the norm of a vertex-transitive graph
From MaRDI portal
Publication:1319328
DOI10.1007/BF03025720zbMath0798.05036MaRDI QIDQ1319328
Publication date: 20 October 1994
Published in: Mathematische Zeitschrift (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/174528
spectral radius; Cayley graphs; adjacency matrix; infinite graph; linear operator; vertex-transitive graph; adjacency operator; valency
47A30: Norms (inequalities, more than one norm, etc.) of linear operators
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
05C99: Graph theory
Related Items
A characterization of the Leinert property, Not every uniform tree covers Ramanujan graphs, On problems related to growth, entropy, and spectrum in group theory
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