Please use this identifier to cite or link to this item:
http://nopr.niscpr.res.in/handle/123456789/25849Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Joseph, Daisy | - |
| dc.contributor.author | Padmanabhan, A S | - |
| dc.date.accessioned | 2014-01-18T07:18:28Z | - |
| dc.date.available | 2014-01-18T07:18:28Z | - |
| dc.date.issued | 2000-03 | - |
| dc.identifier.issn | 0975-0975(Online); 0376-4710(Print) | - |
| dc.identifier.uri | http://hdl.handle.net/123456789/25849 | - |
| dc.description | 236-246 | en_US |
| dc.description.abstract | Suppose ‹1ω(n)׀2› represents the mean square end to end distance of simple random walks of 'n' steps in D-dimensional Euclidean space it is shown that for simple random walks with exclusion of immediate reversals in D-dimensional Euclidean space: . . | en_US |
| dc.language.iso | en_US | en_US |
| dc.publisher | NISCAIR-CSIR, India | en_US |
| dc.rights |  CC Attribution-Noncommercial-No Derivative Works 2.5 India | en_US |
| dc.source | IJC-A Vol.39A(01-03) [January-March 2000] | en_US |
| dc.title | Some enumeration theorems for self-avoiding walks I. | en_US |
| dc.type | Article | en_US |
| Appears in Collections: | IJC-A Vol.39A(01-03) [January-March 2000] | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| IJCA 39A(01-03) 236-246.pdf | 3.47 MB | Adobe PDF | View/Open |
Items in NOPR are protected by copyright, with all rights reserved, unless otherwise indicated.