The Generalized Road Coloring Problem and periodic digraphs

Details The Generalized Road Coloring Problem and periodic digraphs The Generalized Road Coloring Problem and periodic digraphs

2009-03-02

arxiv.org/abs/0903.0192v1

Applicable Algebra in Engineering, Communication and Computing, 2011, Volume 22, Number 1, Pages 21-35

Mathematics

Combinatorics

16 pages

Scientific paper

A proof of the Generalized Road Coloring Problem, independent of the recent work by Beal and Perrin, is presented, using both semigroup methods and Trakhtman's algorithm. Algebraic properties of periodic, strongly connected digraphs are studied in the semigroup context. An algebraic condition which characterizes periodic, strongly connected digraphs is determined in the context of periodic Markov chains.

Affiliated with

Also associated with

No associations

Rating

The Generalized Road Coloring Problem and periodic digraphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Generalized Road Coloring Problem and periodic digraphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Generalized Road Coloring Problem and periodic digraphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-77472