ON PRIMITIVE GRAPHS WITH EXPONENTS 3


Oleh: Didi Febrian, Saib Suwilo, and Mardiningsih (Department of Mathematics, University of Sumatera Utara, Medan)

Abstract. A connected graph G is primitive provided there is a positive integer k such that for each pair of vertices u and v in G one can find a walk of length k connecting u and v. The smallest of such positive integer is the exponent of G. In this paper we discuss necessary and sufficient conditions for a primitive graph with exponent 3. We then use this result to determine the minimum number of edges contained in graphs with exponent 3.

(Proceedings of the 3rd IMT-GT Regional Conference on Mathematics, Statistics and Applications Universiti Sains Malaysia)

ON PRIMITIVE GRAPHS WITH EXPONENTS 3

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s