@inproceedings{OnExponentsOfPrimitiveGraphs,
publisher = {1st IMT-GT Regional Conference on Mathematics, Statistics and Their Applications 2005},
title = {On Exponents Of Primitive Graphs},
author = {Saib Suwilo},
abstract = {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.},
country = {Indonesia},
year = {2005},
organization = {University of Science Malaysia},
month = {6},
}