Theoretical Statistics and Mathematics Unit, ISI Delhi

March 12, 2013 (Tuesday) ,
3:30 PM at Webinar

Speaker:
Kamal Patra,
NISER Bhubaneswar

Title:
Center, Centroid and Characteristic set of a tree

Abstract of Talk

The characteristic set of a simple connected graph $G$ is a
collection of vertices and edges of $G$ associated with the eigenvectors
of the second smallest Laplacian eigenvalue of $G$. For a tree $T$, the
characteristic set contains either a vertex or an edge of $T$. The center
of $T$ also contains either a vertex or two adjacent vertices (same for
centroid also). The behavior of center, centroid and characteristic set
among all trees on $n$ vertices will be discussed in this talk.