A two-colored digraph D(2) is a digraph D whose each of its arc is colored by either red or blue. For nonnegative integers s and t with s+t > 0, an (s, t)-walk in a two-colored digraph is a walk of length s+t consisting of s red arcs and t blue arcs. The vector (s, t)T is the composition of the walk. A two-colored digraph D(2) is primitive provided that there exist nonnegative integers h and k such that for each pair of vertices u and v in D(2) there is an (h, k)-walk in D(2) from u to v. For a two-colored digraph consisting of two cycles D(2), we established a formula for the exponent of D(2) in terms of the compositions of its cycles and the compositions of two specified paths in D(2). We then apply the formula to the class of two-colored digraphs consisting of two cycles whose lengths differ by 1 and to the class of two-colored digraph consisting a cycle and a loop.
Skip Nav Destination
Article navigation
22 May 2012
THE 5TH INTERNATIONAL CONFERENCE ON RESEARCH AND EDUCATION IN MATHEMATICS: ICREM5
22–24 October 2011
Bandung, Indonesia
Research Article|
May 22 2012
Exponents of two-colored digraphs consisting of two cycles
Saib Suwilo
Saib Suwilo
Department of Mathematics, University of Sumatera Utara,
Indonesia
Search for other works by this author on:
AIP Conf. Proc. 1450, 297–304 (2012)
Citation
Saib Suwilo; Exponents of two-colored digraphs consisting of two cycles. AIP Conf. Proc. 22 May 2012; 1450 (1): 297–304. https://doi.org/10.1063/1.4724158
Download citation file:
Pay-Per-View Access
$40.00
Sign In
You could not be signed in. Please check your credentials and make sure you have an active account and try again.
Citing articles via
Design of a 100 MW solar power plant on wetland in Bangladesh
Apu Kowsar, Sumon Chandra Debnath, et al.
The effect of a balanced diet on improving the quality of life in malignant neoplasms
Yu. N. Melikova, A. S. Kuryndina, et al.
Animal intrusion detection system using Mask RCNN
C. Vijayakumaran, Dakshata, et al.
Related Content
The structural properties of zero divisor difference digraphs
AIP Conference Proceedings (June 2016)
Front Matter for Volume 1450
AIP Conference Proceedings (May 2012)
Cycle-supermagic covering on grid graph and K 1 , n + K ¯ 2
AIP Conf. Proc. (October 2018)
Algorithm for K shortest paths in parallel
AIP Conference Proceedings (February 2021)