180 research outputs found
Tight upper bound on the maximum anti-forcing numbers of graphs
Let be a simple graph with a perfect matching. Deng and Zhang showed that
the maximum anti-forcing number of is no more than the cyclomatic number.
In this paper, we get a novel upper bound on the maximum anti-forcing number of
and investigate the extremal graphs. If has a perfect matching
whose anti-forcing number attains this upper bound, then we say is an
extremal graph and is a nice perfect matching. We obtain an equivalent
condition for the nice perfect matchings of and establish a one-to-one
correspondence between the nice perfect matchings and the edge-involutions of
, which are the automorphisms of order two such that and
are adjacent for every vertex . We demonstrate that all extremal
graphs can be constructed from by implementing two expansion operations,
and is extremal if and only if one factor in a Cartesian decomposition of
is extremal. As examples, we have that all perfect matchings of the
complete graph and the complete bipartite graph are nice.
Also we show that the hypercube , the folded hypercube ()
and the enhanced hypercube () have exactly ,
and nice perfect matchings respectively.Comment: 15 pages, 7 figure
An ETH-Tight Exact Algorithm for Euclidean TSP
We study exact algorithms for {\sc Euclidean TSP} in . In the
early 1990s algorithms with running time were presented for
the planar case, and some years later an algorithm with
running time was presented for any . Despite significant interest in
subexponential exact algorithms over the past decade, there has been no
progress on {\sc Euclidean TSP}, except for a lower bound stating that the
problem admits no algorithm unless ETH fails. Up to
constant factors in the exponent, we settle the complexity of {\sc Euclidean
TSP} by giving a algorithm and by showing that a
algorithm does not exist unless ETH fails.Comment: To appear in FOCS 201
On the central levels problem
The \emph{central levels problem} asserts that the subgraph of the -dimensional hypercube induced by all bitstrings with at least many 1s and at most many 1s, i.e., the vertices in the middle levels, has a Hamilton cycle for any and .
This problem was raised independently by Buck and Wiedemann, Savage, Gregor and {\v{S}}krekovski, and by Shen and Williams, and it is a common generalization of the well-known \emph{middle levels problem}, namely the case , and classical binary Gray codes, namely the case .
In this paper we present a general constructive solution of the central levels problem.
Our results also imply the existence of optimal cycles through any sequence of consecutive levels in the -dimensional hypercube for any and .
Moreover, extending an earlier construction by Streib and Trotter, we construct a Hamilton cycle through the -dimensional hypercube, , that contains the symmetric chain decomposition constructed by Greene and Kleitman in the 1970s, and we provide a loopless algorithm for computing the corresponding Gray code
Resonance graphs of plane bipartite graphs as daisy cubes
We characterize all plane bipartite graphs whose resonance graphs are daisy
cubes and therefore generalize related results on resonance graphs of benzenoid
graphs, catacondensed even ring systems, as well as 2-connected outerplane
bipartite graphs. Firstly, we prove that if is a plane elementary bipartite
graph other than , then the resonance graph is a daisy cube if and
only if the Fries number of equals the number of finite faces of , which
in turn is equivalent to being homeomorphically peripheral color
alternating. Next, we extend the above characterization from plane elementary
bipartite graphs to all plane bipartite graphs and show that the resonance
graph of a plane bipartite graph is a daisy cube if and only if is
weakly elementary bipartite and every elementary component of other than
is homeomorphically peripheral color alternating. Along the way, we prove
that a Cartesian product graph is a daisy cube if and only if all of its
nontrivial factors are daisy cubes
Optimal Permutation Routing for Low-dimensional Hypercubes
We consider the offline problem of routing a permutation of tokens on the nodes of a d-dimensional hypercube, under a queueless MIMD communication model (under the constraints that each hypercube edge may only communicate one token per communication step, and each node may only be occupied by a single token between communication steps). For a d-dimensional hypercube, it is easy to see that d communication steps are necessary. We develop a theory of “separability ” which enables an analytical proof that d steps suffice for the case d = 3, and facilitates an experimental verification that d steps suffice for d = 4. This result improves the upper bound for the number of communication steps required to route an arbitrary permutation on arbitrarily large hypercubes to 2d − 4. We also find an interesting side-result, that the number of possible communication steps in a d-dimensional hypercube is the same as the number of perfect matchings in a (d + 1)-dimensional hypercube, a combinatorial quantity for which there is no closed-form expression. Finally we present some experimental observations which may lead to a proof of a more general result for arbitrarily large dimension d. 2
- …