34,991 research outputs found
Lower Bounds for Subgraph Detection in the CONGEST Model
In the subgraph-freeness problem, we are given a constant-sized graph H, and wish to de- termine whether the network graph contains H as a subgraph or not. Until now, the only lower bounds on subgraph-freeness known for the CONGEST model were for cycles of length greater than 3; here we extend and generalize the cycle lower bound, and obtain polynomial lower bounds for subgraph-freeness in the CONGEST model for two classes of subgraphs.
The first class contains any graph obtained by starting from a 2-connected graph H for which we already know a lower bound, and replacing the vertices of H by arbitrary connected graphs. We show that the lower bound on H carries over to the new graph. The second class is constructed by starting from a cycle Ck of length k ? 4, and constructing a graph H ? from Ck by replacing each edge {i, (i + 1) mod k} of the cycle with a connected graph Hi, subject to some constraints on the graphs H_{0}, . . .H_{k?1}. In this case we obtain a polynomial lower bound for the new graph H ?, depending on the size of the shortest cycle in H ? passing through the vertices of the original k-cycle
Quantum statistics on graphs
Quantum graphs are commonly used as models of complex quantum systems, for
example molecules, networks of wires, and states of condensed matter. We
consider quantum statistics for indistinguishable spinless particles on a
graph, concentrating on the simplest case of abelian statistics for two
particles. In spite of the fact that graphs are locally one-dimensional, anyon
statistics emerge in a generalized form. A given graph may support a family of
independent anyon phases associated with topologically inequivalent exchange
processes. In addition, for sufficiently complex graphs, there appear new
discrete-valued phases. Our analysis is simplified by considering combinatorial
rather than metric graphs -- equivalently, a many-particle tight-binding model.
The results demonstrate that graphs provide an arena in which to study new
manifestations of quantum statistics. Possible applications include topological
quantum computing, topological insulators, the fractional quantum Hall effect,
superconductivity and molecular physics.Comment: 21 pages, 6 figure
On Minimum Average Stretch Spanning Trees in Polygonal 2-trees
A spanning tree of an unweighted graph is a minimum average stretch spanning
tree if it minimizes the ratio of sum of the distances in the tree between the
end vertices of the graph edges and the number of graph edges. We consider the
problem of computing a minimum average stretch spanning tree in polygonal
2-trees, a super class of 2-connected outerplanar graphs. For a polygonal
2-tree on vertices, we present an algorithm to compute a minimum average
stretch spanning tree in time. This algorithm also finds a
minimum fundamental cycle basis in polygonal 2-trees.Comment: 17 pages, 12 figure
- …