Aysel Erey

Publications | Journal Articles

Academic Journal

• Erey, A., Gershkoff, Z., Lohss, A., Rohatgi, R., (2025). Characterization and enumeration of 3-regular permutation graphs. Rocky Mountain Journal of Mathematics, 55:1, 89-100.
• Engbers, J., Erey, A., (2025). On average sizes and enumeration of minimal edge covers. Discrete Applied Mathematics, 371, 148-164.
• Burnham, M., Erey, A., (2025). On the roots of maximal matching polynomials. Discrete Mathematics, 348:9, 114547.
• Bresar, B., Dravec, T., Erey, A., Hedzet, J., (2024). Spreading in graphs. Discrete Applied Mathematics, 353, 139-150.
• Engbers, J., Erey, A., (2024). Extremal graphs for Widom-Rowlinson colorings in k-chromatic graphs. Graphs and Combinatorics, 40, 134.
• Brown, D.E, Clawson, C., Erey, A., Garcia, R., Green, C., Hein, D., Powell, S., (2024). Fractional Vertex Cover Reliability of Graphs. Journal of Combinatorial Mathematics and Combinatorial Computing, 122, 157-172.
• Engbers, J., Erey, A., (2023). Extremal graphs for average sizes of maximal matchings. Discrete Applied Mathematics, 341, 308-321.
• Erey, A., (2023). On the average order of a dominating set of a forest. Discrete Mathematics, 346:1, 113127. doi: https://doi.org/10.1016/j.disc.2022.113127
• Engbers, J., Erey, A., Fox, J., He, X., (2021). Tomescu’s graph coloring conjecture for l-connected graphs. SIAM Journal on Discrete Mathematics, 35:2, 1478-1502. doi: https://doi.org/10.1137/19M1306646
• Erey, A., (2021). Maximal distance spectral radius of 4-chromatic planar graphs. Linear Algebra and its Applications, 618, 183-202. doi: https://doi.org/10.1016/j.laa.2021.02.005
• Erey, A., (2020). Uniform Length Dominating Sequence Graphs. Graphs and Combinatorics, 36:6, 1819–1825 . doi: https://doi.org/10.1007/s00373-020-02221-5
• Erey, A., (2019). A broken cycle theorem for the restrained chromatic function. Turkish Journal of Mathematics, 43, doi: https://doi.org/10.3906/mat-1807-200
• Engbers, J., Erey, A., (2018). Extremal colorings and independent sets. Graphs and Combinatorics, 34:6, 1347–1361. doi: https://doi.org/10.1007/s00373-018-1951-3
• Erey, A., (2018). Maximizing the number of x-colorings of 4-chromatic graphs. Discrete Mathematics, 341:5, 1419-1431. doi: https://doi.org/10.1016/j.disc.2017.09.028
• Erey, A., (2018). On the maximum number of colorings of a graph. Journal of Combinatorics, 9:3, 489 – 497. doi: DOI: https://dx.doi.org/10.4310/JOC.2018.v9.n3.a4
• Abiad, A., Brimkov, B., Erey, A., Leshock, L., Martinez-Rivera, X., O, S., Song, S., Williford, J., (2017). On the Wiener index, distance cospectrality and transmission regular graphs. Discrete Applied Mathematics, 230, 1-10.
• Brown, J., Erey, A., (2017). Restraints Permitting the Largest Number of Colourings. Discrete Applied Mathematics, 222, 76-88. doi: https://doi.org/10.1016/j.dam.2017.01.022
• Brown, J., Erey, A., (2016). On the roots of σ-polynomials. Journal of Graph Theory, 82:1, 90-102. doi: https://doi.org/10.1002/jgt.21889
• Brown, J., Erey, A., (2016). On the Real Roots of σ-Polynomials. Graphs and Combinatorics, 32:5, 1723–1730. doi: https://doi.org/10.1007/s00373-016-1684-0
• Brown, J., Erey, A., Li, J., (2015). Extremal restraints for graph colourings. Journal of Combinatorial Mathematics and Combinatorial Computing, 93, 297-304.
• Brown, J., Erey, A., (2015). New Bounds for Chromatic Polynomials and Chromatic Roots. Discrete Mathematics, 338:11, 1938-1946.
• Brown, J., Erey, A., (2014). A note on the real part of complex chromatic roots. Discrete Mathematics, 328, 96-101.
• Ekim, T., Erey, A., (2014). Block decomposition approach to compute a minimum geodetic set. RAIRO Operations Research, 48:04, 497-507.

An asterisk (*) at the end of a publication indicates that it has not been peer-reviewed.

Publications | Other

An asterisk (*) at the end of a publication indicates that it has not been peer-reviewed.