Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A combinatorial trace method: counting closed walks to assay graph eigenvalues

From MaRDI portal
Publication:350772
Jump to:navigation, search

DOI10.1216/RMJ-2013-43-2-469zbMath1268.05124MaRDI QIDQ350772

Mike Krebs, Keith Dsouza

Publication date: 3 July 2013

Published in: Rocky Mountain Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.rmjm/1372776701


zbMATH Keywords

Cayley graphadjacency matrixbinomial coefficientRamanujan graphAlon-Boppana theorem


Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)


Related Items (1)

Unnamed Item




This page was built for publication: A combinatorial trace method: counting closed walks to assay graph eigenvalues

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:350772&oldid=12224742"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 02:42.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki