Aysel Erey

According to our database, Aysel Erey authored at least 15 papers between 2012 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Spreading in graphs.

Bostjan Bresar, Tanja Dravec, Aysel Erey, Jaka Hedzet

Discret. Appl. Math., 2024

2023

Extremal graphs for average sizes of maximal matchings.

John Engbers, Aysel Erey

Discret. Appl. Math., December, 2023

On the average order of a dominating set of a forest.

Aysel Erey

Discret. Math., 2023

2021

Tomescu's Graph Coloring Conjecture for ℓ-Connected Graphs.

John Engbers, Aysel Erey, Jacob Fox, Xiaoyu He

SIAM J. Discret. Math., 2021

2020

Uniform Length Dominating Sequence Graphs.

Aysel Erey

Graphs Comb., 2020

2018

Extremal Colorings and Independent Sets.

John Engbers, Aysel Erey

Graphs Comb., 2018

Maximizing the number of x-colorings of 4-chromatic graphs.

Aysel Erey

Discret. Math., 2018

2017

Restraints permitting the largest number of colourings.

Jason I. Brown, Aysel Erey

Discret. Appl. Math., 2017

On the Wiener index, distance cospectrality and transmission-regular graphs.

Aida Abiad, Boris Brimkov, Aysel Erey, Lorinda Leshock, Xavier Martínez-Rivera, Suil O, Sung-Yell Song, Jason Williford

Discret. Appl. Math., 2017

2016

On the Roots of σ-Polynomials.

Jason I. Brown, Aysel Erey

J. Graph Theory, 2016

On the Real Roots of σ -Polynomials.

Jason I. Brown, Aysel Erey

Graphs Comb., 2016

2015

New bounds for chromatic polynomials and chromatic roots.

Jason I. Brown, Aysel Erey

Discret. Math., 2015

2014

Block decomposition approach to compute a minimum geodetic set.

Tínaz Ekim, Aysel Erey

RAIRO Oper. Res., 2014

A note on the real part of complex chromatic roots.

Jason I. Brown, Aysel Erey

Discret. Math., 2014

2012

Computing Minimum Geodetic Sets of Proper Interval Graphs.

Tínaz Ekim, Aysel Erey, Pinar Heggernes, Pim van 't Hof, Daniel Meister

Proceedings of the LATIN 2012: Theoretical Informatics, 2012