Oleh: Didi Febrian, Saib Suwilo, and Mardiningsih (Department of Mathematics, University of Sumatera Utara, Medan)
Abstract. A connected graph is primitive provided there is a positive integer such that for each pair of vertices and in one can find a walk of length connecting and . The smallest of such positive integer is the exponent of . In this paper we discuss necessary and sufficient conditions for a primitive graph with exponent . We then use this result to determine the minimum number of edges contained in graphs with exponent .
(Proceedings of the 3rd IMT-GT Regional Conference on Mathematics, Statistics and Applications Universiti Sains Malaysia)