A. Erey

most citedMaximal distance spectral radius of 4-chromatic planar graphs

3 citations · 3 across the 2 of their papers we have counts for

collaborators

3 papers

math.CO2021★ 3 cited

Maximal distance spectral radius of 4-chromatic planar graphs

Aysel Erey

We show that the kite graph $K_{4}^{(n)}$ uniquely maximizes the distance spectral radius among all connected $4$ -chromatic planar graphs on $n$ vertices.

math.CO2019

Tomescu's graph coloring conjecture for $ℓ$ -connected graphs

John Engbers, Aysel Erey, Jacob Fox +1

Let $P_{G} (k)$ be the number of proper $k$ -colorings of a finite simple graph $G$ . Tomescu's conjecture, which was recently solved by Fox, He, and Manners, states that $P_G(k) \le k!…

math.CO2019

Uniform Length Dominating Sequence Graphs

Aysel Erey

A sequence of vertices $(v_{1}, \dots, v_{k})$ of a graph $G$ is called a {\it dominating closed neighborhood sequence} if ${v_{1}, \dots, v_{k}}$ is a dominating set of $G$ an…

Maximal distance spectral radius of 4-chromatic planar graphs

Tomescu's graph coloring conjecture for ℓ-connected graphs

Uniform Length Dominating Sequence Graphs

Tomescu's graph coloring conjecture for $ℓ$ -connected graphs