**Speaker**: Wenxue Du (杜文学), Anhui University

**Date**: Tue, Jul 10, 2018

**Time**: 16:45 - 17:45

**Venue**: Middle Meeting Room

**Title**: On a measure of graphs

**Abstract**:

As well-known, if there exists a bijection between two graphs $G$ and $H$ preserving all adjacency and non-adjacency relations in $G$, $G$ and $H$ are said to be isomorphic to one another. In the case of not being isomorphic, we naturally want to define a measure assessing the difference between $G$ and $H$. In this talk, we shall first introduce a simple measure of graphs and then develop a geometric machinery that leads to an effective algorithm for it.

**Slides**:
View slides