On the non-backtracking spectral radius of graphs
From MaRDI portal
(Redirected from Publication:5078597)
Recommendations
Cites work
- A bound on the spectral radius of graphs
- A proof of Alon’s second eigenvalue conjecture and related problems
- Bipartiteness and the least eigenvalue of signless Laplacian of graphs
- Bounds on eigenvalues and chromatic numbers
- Eigenspaces of graphs
- Graph theory
- scientific article; zbMATH DE number 193132 (Why is no real title available?)
- scientific article; zbMATH DE number 1495995 (Why is no real title available?)
- Ihara zeta functions of coronae
- Maximizing the spectral radius of k-connected graphs with given diameter
- NON-BACKTRACKING RANDOM WALKS MIX FASTER
- Nonbacktracking eigenvalues under node removal: X-centrality and targeted immunization
- On discrete subgroups of the two by two projective linear group over \(p\)-adic fields
- On the spectral radius of graphs with connectivity at most \(k\)
- Some spectral properties of the non-backtracking matrix of a graph
- The Moore bound for irregular graphs
- The non-backtracking spectrum of the universal cover of a graph
- Zeta functions of finite graphs and coverings
Cited in
(5)- Some spectral properties of the non-backtracking matrix of a graph
- Non-backtracking spectra of weighted inhomogeneous random graphs
- The non-backtracking spectrum of the universal cover of a graph
- There is no going back: properties of the non-backtracking Laplacian
- Spectral theory of the non-backtracking Laplacian for graphs
This page was built for publication: On the non-backtracking spectral radius of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5078597)