On the number of clusters for planar graphs

arXivcond-mat/0606495MaRDI QIDQ6466063FDOQ6466063

Authors: Jean-Michel Billiot, Franck Corset, Éric Fontenas 

Publication date: 19 June 2006

Abstract: The Tutte polynomial is a powerfull analytic tool to study the structure of planar graphs. In this paper, we establish some relations between the number of clusters per bond for planar graph and its dual : these relations bring into play the coordination number of the graphs. The factorial moment measure of the number of clusters per bond are given using the derivative of the Tutte polynomial. Examples are presented for simple planar graph. The cases of square, triangular, honeycomb, Archimedean and Laves lattices are discussed.

This page was built for publication: On the number of clusters for planar graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6466063)