Grant: Discovery Grants Program - Individual
University of Winnipeg
$22,000.00
Graphs and their structure: the interplay between local and global properties of graphs
FY 2021-22
Summary
cycles and paths; graph convexity; local versus global properties; mean size of convex sets and graph structure; reconstructing a graph from its digital convexity; structured graph classes; the metric dimension and its variants
Program
Discovery Grants Program - Individual
Recipient
Location
Manitoba, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data
As published
Application id
RGPIN-2016-05237
Name nom
Oellermann, Ortrud
Department département
Mathematics and Statistics
Organization id
21
Institution établissement
University of Winnipeg
Province en
Manitoba
Province fr
Manitoba
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2021
Competition year année de concours
2016
Award amount
22000
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
1508
Committee name en
Mathematics and Statistics
Committee name fr
Mathématiques et statistique
Area of application code
800
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
Information and communication services
Area of application fr
Services d'information et de télécommunications
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
Installment
inst:6
Partie
1
Nb partie
6
Application title
Graphs and their structure: the interplay between local and global properties of graphs
Keyword
NSERC
Application summary
cycles and paths; graph convexity; local versus global properties; mean size of convex sets and graph structure; reconstructing a graph from its digital convexity; structured graph classes; the metric dimension and its variants
