Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Tuesday, May 13, 2008, 12:15 pm

Duration: This information is not available in the database

Location: OAT S15/S16/S17

Speaker: Alexandru Tomescu (Univ. of Bukarest)

Minimal Graphs with respect to the Degree Distance

Topological indices and graph invariants based on the distances between the vertices of a graph are widely used in theoretical chemistry to establish relations between the structure and the properties of molecules. One of these indices is the degree distance, which also takes into account the degree of each vertex. In this talk I will discuss two methods to obtain minimal graphs: one is based on a set of transformations on the degree sequence of a graph, and the other one makes a correspondence to minimal graphs w.r.t. the sum of squares of the degrees of the vertices.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2024  2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login