学术报告第201725期

报告题目：DISTANCE-BASED CONCEPTS IN GRAPHS

报 告 人：Sastha Sriram教授（K L University）

报告时间：2017年5月25日16：00

报告地点：南一楼中314室

Abstract : Graph Theory is considered as a branch of Discrete Mathematics but has connections with several areas including computer science with wide applications. The notion of distance in a graph has played a vital role in analyzing the features of complex networks when they are modelled as graphs. The distance between any two vertices or nodes in an undirected graph is the length of the shortest path between them. A node v in a graph at a maximum distance from the node u is called an eccentric vertex of u. The concept of eccentric graph of a graph G, having the same vertices as of G and edges between a vertex and its eccentric vertices, was introduced in studies on distances in graphs.  In this talk, we introduce basis notions on graphs, eccentric graphs and discuss the structure of eccentric graphs of classes of graphs including possible applications.

Short CV:  S. Sriram received his PhD in 2015 from Manonmaniam Sundaranar University, India. He is currently a Professor in the Department of Mathematics, K L University, Andhra Pradesh, India, having served different institutions prior to this position. His main area of research falls under the broad topic of Graph Theory and Applications and his research interests include Combinatorics on words and membrane computing. He has visited Universiti Sains Malaysia and some reputed institutions in India for collaborative research. He has published his work in reputed journals.