Abstract
A simple derivation of the Temperley-Nagle identity for graph embeddings is given. It is shown that the identity leads to a sum-rule relation connecting the lattice constants of strong and weak embeddings. It is also shown that the identity yields the fluctuation of the number of bonds (sites) in a site (bond) percolation.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
