This paper investigates a method for decentralized stabilization of vehicle formations using techniques from algebraic graph theory. The vehicles exchange information according to a pre-specifiedâ€¦ (More)

Let C denote a bipartite distance-regular graph with diameter D 12. We show C is Q-polynomial if and only if one of the following (i)â€“(iv) holds: (i) C is the ordinary 2D-cycle. (ii) C is the Hammingâ€¦ (More)

Let G denote a directed graph with adjacency matrix Q and indegree matrix D. We consider the Kirchhoff matrix L = D âˆ’ Q, sometimes referred to as the directed Laplacian. A classical result ofâ€¦ (More)

Let Y denote a D-class symmetric association scheme with D > 3, and suppose Y is bipartite Pand Q-polynomial. Let T denote the Terwilliger algebra with respect to any vertex X. We prove that anyâ€¦ (More)

Let Y Âˆ Â…X ; fRig0UiUDÂ† denote a symmetric association scheme with DV 3, and assume Y is not an ordinary cycle. Suppose Y is bipartite P-polynomial with respect to the given ordering A0; A1; . . .â€¦ (More)

This paper presents a synthesis algorithm, Covering Set Partitions (CSP), for reversible binary functions with no ancillary (garbage) bits. Existing algorithms are constrained to functions of smallâ€¦ (More)