Home | Business News | Browse by Publication | M | Michigan Academician

Computers.

Publication: Michigan Academician
Publication Date: 01-JAN-08 		Format: Online
Delivery: Immediate Online Access

Article Excerpt
Some Results on Synchronization in Colored Digraphs. Ranjan Chaudhuri, Eastern Michigan University

Let G=(V,E) be a strongly connected digraph in which the out-degree of each vertex is equal to two. A red-blue coloring of G is a coloring of its edges with the colors red(R) and blue(B) such that each vertex has an outgoing edge colored red(R) and the other outgoing edge colored blue(B). We define a string I belonging to {R,B}* to he an. instruction. For a vertex v in V, let l(v) denote the vertex w that is reachable from v if one follows the directed path labeled by the colors in I. We define two vertices...

View this article FREE - Now for a Limited Time, try Goliath Business News
Free for 3 Days!



More articles from Michigan Academician
Economics., January 01, 2008
Environmental Science & ecology.(reports), January 01, 2008
French & Italian.(reports), January 01, 2008
Geography., January 01, 2008
Geological Sciences., January 01, 2008

Looking for additional articles?
Search our database of over 3 million articles.

Looking for more in-depth information on this industry?
Search our complete database of Industry & Market reports by text, subject, publication name or publication date.

About Goliath
Whether you're looking for sales prospects, competitive information, company analysis or best practices in managing your organization, Goliath can help you meet your business needs.

Our extensive business information databases empower business professionals with both the breadth and depth of credible, authoritative information they need to support their business goals. Whether it be strategic planning, sales prospecting, company research or defining management best practices - Goliath is your leading source for accurate information.