2,597 research outputs found
Multiswapped networks and their topological and algorithmic properties
We generalise the biswapped network Bsw(G)Bsw(G) to obtain a multiswapped network Msw(H;G)Msw(H;G), built around two graphs G and H. We show that the network Msw(H;G)Msw(H;G) lends itself to optoelectronic implementation and examine its topological and algorithmic. We derive the length of a shortest path joining any two vertices in Msw(H;G)Msw(H;G) and consequently a formula for the diameter. We show that if G has connectivity κ⩾1κ⩾1 and H has connectivity λ⩾1λ⩾1 where λ⩽κλ⩽κ then Msw(H;G)Msw(H;G) has connectivity at least κ+λκ+λ, and we derive upper bounds on the (κ+λ)(κ+λ)-diameter of Msw(H;G)Msw(H;G). Our analysis yields distributed routing algorithms for a distributed-memory multiprocessor whose underlying topology is Msw(H;G)Msw(H;G). We also prove that if G and H are Cayley graphs then Msw(H;G)Msw(H;G) need not be a Cayley graph, but when H is a bipartite Cayley graph then Msw(H;G)Msw(H;G) is necessarily a Cayley graph
AKLT Models with Quantum Spin Glass Ground States
We study AKLT models on locally tree-like lattices of fixed connectivity and
find that they exhibit a variety of ground states depending upon the spin,
coordination and global (graph) topology. We find a) quantum paramagnetic or
valence bond solid ground states, b) critical and ordered N\'eel states on
bipartite infinite Cayley trees and c) critical and ordered quantum vector spin
glass states on random graphs of fixed connectivity. We argue, in consonance
with a previous analysis, that all phases are characterized by gaps to local
excitations. The spin glass states we report arise from random long ranged
loops which frustrate N\'eel ordering despite the lack of randomness in the
coupling strengths.Comment: 10 pages, 1 figur
Edge-transitivity of Cayley graphs generated by transpositions
Let be a set of transpositions generating the symmetric group . The
transposition graph of is defined to be the graph with vertex set
, and with vertices and being adjacent in
whenever . In the present note, it is proved that two
transposition graphs are isomorphic if and only if the corresponding two Cayley
graphs are isomorphic. It is also proved that the transposition graph is
edge-transitive if and only if the Cayley graph is
edge-transitive
- …