CIS Department Talk - June 13th, 2008

The Department of Computer and Information Science Present

Speaker:	Xing de Jia, Texas State Univeristy
Topic:	On Wide Diameter of Cayley Digraphs of Cyclic Groups
Date:	June 13th, 2008, 11:00 AM
Place:	Lincoln Center Campus, Lowenstein, Room 816

Let G be a simple graph. A container C(x,y) between two distinct vertices x and y in G is a set of vertex-disjoint paths between x and y in G. The {length} of C(x,y) is the length of the longest path in C(x,y). Let C_\lambda(u,v) denote the container with width larger than or equal to \lambda that has the shortest length. The \lambda-distance between x and y, denoted as d_\lambda(u,v), is the minimal length of all the containers between x and y with width \lambda. The \lambda-wide diameter of G is the maximum \lambda-wide distance among all pairs of distinct vertices x and y in G. In this paper, we prove, for every positive integer k, that the k-wide diameter of the Cayley digraph Cay(Z_m,A) is at most one larger than the diameter of Cay(Z_m,A) if A is an “m-ideal” set of k positive integers.

Bio:
Dr. Xing de Jia received his Ph.D. in Mathematics from The City University of New York, New York, USA, in 1990 and his B.S. degree in mathematics from Qufu Normal University, China, in 1982. He is a Professor of Mathematics at Texas State University, San Marcos, Texas. He has been an Instructor of Mathematics at Fordham University. He and collaborators have appeared in more than 30 peer reviewed papers including the Journal of Interconnection Networks, In Number Theory, Congressus Numerantium, and J. Number Theory to name a few.

For More Information Contact: Ms. Danielle Aprea 718-817-4480 or Email: aprea@cis.fordham.edu