Tensor networks and the enumeration of regular subgraphs

Details Tensor networks and the enumeration of regular subgraphs Tensor networks and the enumeration of regular subgraphs

2006-05-10

arxiv.org/abs/math/0605256v1

Mathematics

Combinatorics

Scientific paper

We propose a universal approach to a range of enumeration problems in graphs. The key point is in contracting suitably chosen symmetric tensors placed at the vertices of a graph along the edges. In particular, this leads to an algorithm that counts the number of d-regular subgraphs of an arbitrary graph including the number of d-factors (previously we considered the case d=2 with a special emphasis on the enumeration of Hamiltonian cycles; cf. math.CO/0403339). We briefly discuss the problem of the computational complexity of this algorithm.

Affiliated with

Also associated with

No associations

Rating

Tensor networks and the enumeration of regular subgraphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Tensor networks and the enumeration of regular subgraphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Tensor networks and the enumeration of regular subgraphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-705882