|
Izvestiya Vysshikh Uchebnykh Zavedenii. Matematika, 2010, Number 1, Pages 14–20
(Mi ivm6549)
|
|
|
|
This article is cited in 2 scientific papers (total in 2 papers)
A vector space approach to the road coloring problem
G. Budzban, Ph. Feinsilver Department of Mathematics, Southern Illinois University at Carbondale, Carbondale, IL, USA
Abstract:
Let $G$ be a strongly connected, aperiodic, two-out digraph with adjacency matrix $A$. Suppose $A=R+B$ are coloring matrices: that is, matrices that represent the functions induced by an edge-coloring of $G$. We introduce a matrix $\Delta=\frac12(R-B)$ and investigate its properties. A number of useful conditions involving $\Delta$ which either are equivalent to or imply a solution to the road coloring problem are derived.
Keywords:
digraph, synchronizing automaton, road coloring.
Received: 21.10.2006
Citation:
G. Budzban, Ph. Feinsilver, “A vector space approach to the road coloring problem”, Izv. Vyssh. Uchebn. Zaved. Mat., 2010, no. 1, 14–20; Russian Math. (Iz. VUZ), 54:1 (2010), 10–15
Linking options:
https://www.mathnet.ru/eng/ivm6549 https://www.mathnet.ru/eng/ivm/y2010/i1/p14
|
Statistics & downloads: |
Abstract page: | 416 | Full-text PDF : | 83 | References: | 39 | First page: | 6 |
|