Grant: Discovery Grants Program - Individual
University of Regina
$257.00
An investigation of combinatorial problems
EF 2007-08
Résumé
Searching for intruders in graphs (networks) is one of the problems I shall be studying. I shall be considering certain families of graphs with a view towards determining the minimum number of searchers required, or the minimum time required for a fixed number of available searchers. Another topic of investigation is graph decompositions. This is a continuation of work I have been doing for many years. Some of the results have applications in scheduling. The final broad topic of investigation is Cayley graphs. These are graphs that are constructed using groups. They possess a large amount of symmetry which makes them useful in some surprising applications. I'll be looking at them mainly from the subgraph point of view and isomorphism point of view.
Programme
Discovery Grants Program - Individual
Bénéficiaire
Emplacement
Saskatchewan, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data
Tel que publié
Application id
4792-2006
Name nom
Alspach, Brian
Department département
Mathematics and Statistics
Organization id
17
Institution établissement
University of Regina
Province en
Saskatchewan
Province fr
Saskatchewan
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2007
Competition year année de concours
2006
Award amount
257
Program id
RGPIN
Program name en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
Discovery grants programs
Group fr
Programmes de subventions à la découverte
Committee code
337
Committee name en
Pure & Applied Maths - B
Committee name fr
Maths pures et appliquées - B
Area of application code
803
Area of application group en
Information and communication services
Area of application group fr
Services d'information et de télécommunications
Area of application en
Computer communications
Area of application fr
Téléinformatique
Research subject code
2914
Research subject group en
Pure mathematics
Research subject group fr
Mathématiques pures
Research subject en
Combinatorics
Research subject fr
Combinatoire
Partie
2
Nb partie
2
Application title
An investigation of combinatorial problems
Keyword
NA
Application summary
Searching for intruders in graphs (networks) is one of the problems I shall be studying. I shall be considering certain families of graphs with a view towards determining the minimum number of searchers required, or the minimum time required for a fixed number of available searchers. Another topic of investigation is graph decompositions. This is a continuation of work I have been doing for many years. Some of the results have applications in scheduling. The final broad topic of investigation is Cayley graphs. These are graphs that are constructed using groups. They possess a large amount of symmetry which makes them useful in some surprising applications. I'll be looking at them mainly from the subgraph point of view and isomorphism point of view.
