The exponent of Cartesian product of cycles

Citations

WEB OF SCIENCE

3
Citations

SCOPUS

2

초록

A digraph D is primitive if for each pair of vertices v, w of D, there is a positive integer k such that there is a directed walk of length k from v to w. The minimum of such k is the exponent of D. In this paper, we show that fora primitive graph G and a strongly connected bipartite digraph D, the exponent of the Cartesian product G x D is equal to the addition of the exponent of G and the diameter of D. Finally, we find the exponents of Cartesian products of cycles. (C) 2008 Elsevier Ltd. All rights reserved.

키워드

Exponent; Cartesian product; Digraphs; PRIMITIVE MATRICES; CONJECTURE; DIGRAPHS; NUMBER; SET
제목
The exponent of Cartesian product of cycles
저자
Kim, Byeong Moon; Song, Byung Chul; Hwang, Woonjae
DOI
10.1016/j.aml.2008.06.030
발행일
2009-04
유형
Article
저널명
Applied Mathematics Letters
권
22
호
4
페이지
561 ~ 564