1. Optimal layout of recursive circulant graphs. Issue 3 (3rd July 2021) Authors: Stalin Mary, R.; Parthiban, N.; Rajasingh, Indra; Manuel, Paul Journal: International journal of computer mathematics Issue: Volume 6:Issue 3(2021) Page Start: 209 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
2. Enumeration of connected components of acyclic digraph. (3rd October 2021) Authors: Al'Dzhabri, Kh. Sh. Journal: Journal of discrete mathematical sciences & cryptography Issue: Volume 24:Number 7(2021) Page Start: 2047 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
3. On a random search tree: asymptotic enumeration of vertices by distance from leaves – CORRIGENDUM. (June 2022) Authors: Bóna, Miklós; Pittel, Boris Journal: Advances in applied probability Issue: Volume 54:Number 2(2022) Page Start: 337 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
4. A Pfaffian formula for matching polynomials of outerplanar graphs. (4th May 2021) Authors: Iwata, Satoru Journal: Optimization methods and software Issue: Volume 36:Number 2/3(2021) Page Start: 332 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗