Growing self avoiding walk trees

DOI10.1007/s10910-013-0267-zzbMath1311.92221OpenAlexW1964199764MaRDI QIDQ2441105

A. S. Padmanabhan

Publication date: 21 March 2014

Published in: Journal of Mathematical Chemistry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10910-013-0267-z

zbMATH Keywords

depth first search treescondensation polymerizationgrowing self avoiding walkgrowth process in polymerization

Mathematics Subject Classification ID

Applications of graph theory (05C90) Classical flows, reactions, etc. in chemistry (92E20) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Random walks on graphs (05C81)

Related Items (1)

Self avoiding walk trees and laces

Cites Work

• Unnamed Item
• Unnamed Item
• Calculation of the connective constant for self-avoiding walks via the pivot algorithm

This page was built for publication: Growing self avoiding walk trees