### Making Walks Count: From Silent Circles to Hamiltonian Cycles

**2016-02-03**

1602.01396 | math.CO

We illustrate the application of the matrix-transfer method for a number of
enumeration problems concerning the party game Silent Circles, Hamiltonian
cycles in the antiprism graphs, and simple paths and cycles of a fixed length
in arbitrary graphs.

**Login to like/save this paper, take notes and configure your recommendations**

# Related Articles

**2018-06-30**

1807.00109 | math.CO

The parity of the length of paths and cycles is a classical and well-studied
topic in graph theory a… show more

**2019-03-17**

1903.07118 | cs.NI

We consider the problem of inferring the topology of a network using the
measurements available at t… show more

**2018-02-19**

1802.06742 | cs.DC

Given two colorings of a graph, we consider the following problem: can we
recolor the graph from one… show more

**2019-01-16**

1901.05264 | cs.CC

Exact pattern matching in labeled graphs is the problem of searching paths of
a graph $G=(V,E)$ that… show more

**2019-03-27**

1903.11246 | cs.SY

This paper presents conditions for establishing topological controllability
in undirected networks o… show more

**2019-03-20**

1903.08332 | cs.IT

Counting short cycles in bipartite graphs is a fundamental problem of
interest in many fields includ… show more

**2017-09-15**

1709.05132 | math.NA

Identifying important components in a network is one of the major goals of
network analysis. Popular… show more

**2018-11-18**

1811.07327 | math.CO

Given an undirected graph, are there $k$ matchings whose union covers all of
its nodes, that is, a m… show more

**2018-08-16**

1808.05676 | cs.DS

Anomaly detection problems (also called change-point detection problems) have
been studied in data m… show more

**2018-12-22**

1812.09422 | math.CO

In this work we consider a straightforward linear programming formulation of
the recently introduced… show more

**2018-06-04**

1806.01433 | cs.DM

Counting short cycles in bipartite graphs is a fundamental problem of
interest in the analysis and d… show more

**2018-10-08**

1810.03491 | cs.DS

We consider the problem of incremental cycle detection and topological
ordering in a directed graph … show more

**2017-06-15**

1706.04746 | cs.DC

The degree splitting problem requires coloring the edges of a graph red or
blue such that each node … show more

**2017-07-08**

1707.02473 | cs.DM

A graph $G$ is {\em matching-decyclable} if it has a matching $M$ such that
$G-M$ is acyclic. Decidi… show more

**2018-05-12**

1805.04776 | cs.DC

The landscape of the distributed time complexity is nowadays well-understood
for subpolynomial compl… show more

**2018-11-15**

1811.06244 | cs.DS

The quartet distance is a measure of similarity used to compare two unrooted
phylogenetic trees on t… show more