The Generalized Road Coloring Problem and periodic digraphs

Mathematics – Combinatorics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

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

     

Profile ID: LFWR-SCP-O-77472

All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.