Analysis on Graphs and its Applications
Cambridge University
Add to My Podcasts
Episodes
About
Reviews
Promote
A lower bound for nodal count on discrete and metric graphs
1 hour 2 minutes
Posted Aug 27, 2008 at 1:13 pm.
-15:00
0:00
1:02:00
Add to My Queue
Download
MP3
Share
episode
Share at current time
Show notes
Berkolaiko, G (Texas A and M)
Monday 02 April 2007,
Quantum Graphs, their Spectra and Applications
Watch Video
Previous
Spectral properties and trace formulae for quantum graphs with general self-adjoint boundary conditions
Next
Spectra of self-adjoint extensions related to the duality between discrete graphs and quantum networks
← See all 113 episodes of Analysis on Graphs and its Applications