On the number of clusters for planar graphs

Simple item page
dc.creatorBilliot, Jean-Michel
dc.creatorCorset, Franck
dc.creatorFontenas, Eric
dc.date2006-06-19
dc.date.accessioned2026-07-07T07:12:45Z
dc.date.available2026-07-07T07:12:45Z
dc.descriptionThe 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.
dc.description14 pages
dc.identifierhttps://arxiv.org/abs/cond-mat/0606495
dc.identifierhttp://arxiv.org/abs/cond-mat/0606495
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/112185
dc.subjectStatistical Mechanics
dc.subjectProbability
dc.titleOn the number of clusters for planar graphs
dc.typetext

Files

Collections

arXiv