44 citations · 71 across the 21 of their papers we have counts for
Showing 1994Show all
3 papers · 1 filter
math.CO1994★ 44 cited
The degree-diameter problem for several varieties of Cayley graphs, I: the Abelian case
Randall Dougherty, Vance Faber
We address the degree-diameter problem for Cayley graphs of Abelian groups (Abelian graphs), both directed and undirected. The problem turns out to be closely related to the proble…
math.CO1994★ 12 cited
Restricted routing and wide diameter of the cycle prefix network
William Y. C. Chen, Vance Faber, Emanuel Knill
The cycle prefix network is a Cayley coset digraph based on sequences over an alphabet which has been proposed as a vertex symmetric communication network. This network has been sh…
math.CO1994
Inverting sets and the packing problem
Vance Faber, Mark Goldberg, Emanuel Knill +1
Given a set , a subset , and a permutation of , we say that permutes if . Given a collection $\cS = \{V; S_1,\ldots , S_m\}$, where $S…