Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Thursday, June 14, 2007, 12:15 pm
Duration: This information is not available in the database
Location: OAT S15/S16/S17
Speaker: Michał Karoński (Univ. of Poznań, Poland)
A weighting of the edges of a graph with integer weights gives rise to a weighting of the vertices, the weight of a vertex being the sum of the weights of its incident edges. An assignment of positive integer weights to the edges of a simple graph G is called irregular if the weighted degrees of the vertices are all different. The irregularity strength is the maximal weight, minimized over all irregular assignments. In this talk I will discuss some recent results and open problems on the irregularity strength of graphs.
Automatic MiSe System Software Version 1.4803M | admin login