| Network reliability: Heading out on the highway JI Brown, CJ Colbourn, D Cox, C Graves, L Mol Networks 77 (1), 146-160, 2021 | 35 | 2021 |
| On the roots of all-terminal reliability polynomials J Brown, L Mol Discrete Mathematics 340 (6), 1287-1299, 2017 | 32 | 2017 |
| Maximizing the mean subtree order L Mol, OR Oellermann Journal of Graph Theory 91 (4), 326-352, 2019 | 30 | 2019 |
| The repetition threshold for binary rich words JD Currie, L Mol, N Rampersad Discrete Mathematics & Theoretical Computer Science 22 (Analysis of Algorithms), 2020 | 17 | 2020 |
| On the mean subtree order of graphs under edge addition B Cameron, L Mol Journal of Graph Theory 96 (3), 403-413, 2021 | 14 | 2021 |
| On the mean connected induced subgraph order of cographs ME Kroeker, L Mol, OR Oellermann arXiv preprint arXiv:1708.01916, 2017 | 12 | 2017 |
| Lengths of extremal square-free ternary words L Mol, N Rampersad arXiv preprint arXiv:2001.11763, 2020 | 11 | 2020 |
| Extremal overlap-free and extremal -free binary words L Mol, N Rampersad, J Shallit arXiv preprint arXiv:2006.10152, 2020 | 9 | 2020 |
| On the roots of the node reliability polynomial J Brown, L Mol Networks 68 (3), 238-246, 2016 | 9 | 2016 |
| The undirected repetition threshold and undirected pattern avoidance JD Currie, L Mol Theoretical Computer Science 866, 56-69, 2021 | 7 | 2021 |
| The threshold dimension of a graph L Mol, MJH Murphy, OR Oellermann Discrete Applied Mathematics 287, 118-133, 2020 | 7 | 2020 |
| On the mean order of connected induced subgraphs of block graphs KJ Balodis, ME Kroeker, L Mol, OR Oellermann arXiv preprint arXiv:1811.05430, 2018 | 7 | 2018 |
| On the roots of Wiener polynomials of graphs JI Brown, L Mol, OR Oellermann Discrete Mathematics 341 (9), 2398-2408, 2018 | 7 | 2018 |
| A family of formulas with reversal of high avoidability index J Currie, L Mol, N Rampersad International Journal of Algebra and Computation 27 (05), 477-493, 2017 | 7 | 2017 |
| Average connectivity of minimally 2-connected graphs and average edge-connectivity of minimally 2-edge-connected graphs RM Casablanca, L Mol, OR Oellermann Discrete Applied Mathematics 289, 233-247, 2021 | 5 | 2021 |
| Avoidance bases for formulas with reversal JD Currie, L Mol, N Rampersad Theoretical Computer Science 738, 25-41, 2018 | 5 | 2018 |
| On connectedness and graph polynomials L Mol | 5 | 2016 |
| The Number of Threshold Words on Letters Grows Exponentially for Every JD Currie, L Mol, N Rampersad arXiv preprint arXiv:1911.05779, 2019 | 4 | 2019 |
| The shape of node reliability JI Brown, L Mol Discrete Applied Mathematics 238, 41-55, 2018 | 4 | 2018 |
| Cobham’s theorem and automaticity L Mol, N Rampersad, J Shallit, M Stipulanti International Journal of Foundations of Computer Science 30 (08), 1363-1379, 2019 | 3 | 2019 |
Narad RampersadUniversity of Winnipeg在 uwinnipeg.ca 的电子邮件经过验证
