Abstract
The Fisher transformation acts on cubic graphs by replacing each vertex by a triangle. We explore the action of the Fisher transformation on the set of self-avoiding walks of a cubic graph. Iteration of the transformation yields a sequence of graphs with common critical exponents, and with connective constants converging geometrically to the golden mean. We consider the application of the Fisher transformation to one of the two classes of vertices of a bipartite cubic graph. The connective constant of the ensuing graph may be expressed in terms of that of the initial graph. When applied to the hexagonal lattice, this identifies a further lattice whose connective constant may be computed rigorously.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.