| 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 |
| Fullerene patches I. JE Graver, CM Graves Ars Math. Contemp. 3 (1), 109-120, 2010 | 24 | 2010 |
| Classes of uniformly most reliable graphs for all-terminal reliability K Archer, C Graves, D Milan Discrete Applied Mathematics 267, 12-29, 2019 | 22 | 2019 |
| Reliability polynomials having arbitrarily many inflection points C Graves, D Milan Networks 64 (1), 1-5, 2014 | 13 | 2014 |
| Fullerene patches II. JE Graver, C Graves, SJ Graves Ars Math. Contemp. 7 (2), 405-421, 2014 | 12 | 2014 |
| Most reliable two‐terminal graphs with node failures I Brown, C Graves, B Miller, T Russell Networks 76 (3), 414-426, 2020 | 11 | 2020 |
| On uniformly most reliable two‐terminal graphs H Bertrand, O Goff, C Graves, M Sun Networks 72 (2), 200-216, 2018 | 11 | 2018 |
| Smallest graphs with given generalized quaternion automorphism group C Graves, SJ Graves, LK Lauderdale Journal of Graph Theory 87 (4), 430-442, 2018 | 10 | 2018 |
| Inflection points of coherent reliability polynomials. C Graves Australas. J Comb. 49, 111-126, 2011 | 9 | 2011 |
| Counting acyclic and strong digraphs by descents K Archer, IM Gessel, C Graves, X Liang Discrete Mathematics 343 (11), 112041, 2020 | 7 | 2020 |
| Vertex-minimal graphs with dihedral symmetry I C Graves, SJ Graves, LK Lauderdale Discrete Mathematics 340 (10), 2573-2588, 2017 | 7 | 2017 |
| Side lengths of pseudoconvex fullerene patches CM Graves, J McLoud-Mann Ars Mathematica Contemporanea 5 (2), 2012 | 7 | 2012 |
| Pattern-restricted permutations composed of 3-cycles K Archer, C Graves Discrete Mathematics 345 (7), 112895, 2022 | 6 | 2022 |
| Vertex-minimal graphs with dihedral symmetry II C Graves, LK Lauderdale Discrete Mathematics 342 (5), 1378-1391, 2019 | 5 | 2019 |
| Cyclic permutations avoiding patterns in both one-line and cycle forms K Archer, E Borsh, J Bridges, C Graves, M Jeske arXiv preprint arXiv:2312.05145, 2023 | 3 | 2023 |
| Extending patches to fullerenes CM Graves, J McLoud-Mann, KS Rovira ARS MATHEMATICA CONTEMPORANEA 9 (2), 2014 | 3 | 2014 |
| Counting symmetric and near-symmetric fullerene patches C Graves, SJ Graves Journal of Mathematical Chemistry 52, 2423-2441, 2014 | 3 | 2014 |
| Non-recursively constructible recursive families of graphs C Bouey, C Graves, A Ostrander, G Palma the electronic journal of combinatorics, P9-P9, 2012 | 2 | 2012 |
| Pattern-restricted cyclic permutations with a pattern-restricted cycle form K Archer, E Borsh, J Bridges, C Graves, M Jeske arXiv preprint arXiv:2408.15000, 2024 | 1 | 2024 |
| More reliable graphs are not always stronger C Graves Networks 81 (4), 490-498, 2023 | 1 | 2023 |
Kassie ArcherUnited States Naval Academy在 usna.edu 的电子邮件经过验证
