Please use this identifier to cite or link to this item:
https://dspace.univ-ouargla.dz/jspui/handle/123456789/22587
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | CHEIKH, Mohamed | - |
dc.contributor.author | GUERBOUSSA, Y | - |
dc.date.accessioned | 2020-01-09T09:09:38Z | - |
dc.date.available | 2020-01-09T09:09:38Z | - |
dc.date.issued | 2019-07-08 | - |
dc.identifier.uri | http://dspace.univ-ouargla.dz/jspui/handle/123456789/22587 | - |
dc.description | Departement of mathematics University Kasdi Merbah Ouargla 30000, Algeria | en_US |
dc.description.abstract | This dissertation treats the notion of expander graphs; these are highly connected graphs which appeared first in computer sciences in connexion with constructing good networks, but stem in fact from deep pure mathematics. We focus on their construction via the Kazdan property (T) | en_US |
dc.language.iso | en | en_US |
dc.relation.ispartofseries | ;2019 | - |
dc.subject | expander graphs | en_US |
dc.subject | computer sciences | en_US |
dc.subject | Kazdan property (T) | en_US |
dc.title | Expander graphs | en_US |
dc.type | Presentation | en_US |
Appears in Collections: | Département de Mathématiques Mastériales |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
CHEIKH MOHAMED.pdf | 173,08 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.