- Full text PDF available (1)

2010

2015

- This year (0)
- Last 5 years (1)
- Last 10 years (2)

Learn More

- Sunny Joseph Kalayathankal, G. Suresh Singh
- Mathematics and Computers in Simulation
- 2010

- Chandoor Susanth, Sunny Joseph Kalayathankal, Naduvath Sudev, Kaithavalappil Chithra, Johan Kok
- 2015

Given a finite nonempty sequence S of integers, write it as XY k , consisting of a prefix X (which may possibly be empty), followed by k copies of a non-empty string Y. Then, the greatest such integer k is called the curling number of S and is denoted by cn(S). The concept of curling number of sequences has already been extended to the degree sequences of… (More)

- ‹
- 1
- ›