On Exponents Of Primitive Graphs

Saib Suwilo

Download full text
(English, 6 pages)

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.

Metrics

  • 187 views
  • 45 downloads

Conference

1st IMT-GT Regional Conference on Mathematics, Statistics and Their Applications 2005

  • Konferensi di Paparat, Індонезія pada tahun 2005
  • 31 articles

The 1st IMT-GT Regional Conference on Mathematics, Statistics and Their Applications (IRCMSA) was... see more