TY - CPAPER
PY - 2005
T2 - 1st IMT-GT Regional Conference on Mathematics, Statistics and Their Applications 2005
T1 - On Exponents Of Primitive Graphs
CY - Indonesia
AB - A connected gaph G is primitive provided there exists a positive integerk such that for each pair of vertices u and v in G there is a walk of lengtht that connects u and v. The smallest of such positive integers k is calledthe exponent of G and is denoted by exp(G). In this paper, we give a newbound on exponent of primitive graphs G in terms of the length of thesmallest cycle of G. We show that the new bound is sharp andgeneralizes the bounds given by Shao and Liu et. al.
AU - Saib Suwilo
DA - 2005/6//
ER -