A. Erey

activity

20132023

x

-colorings of

4

-chromatic graphs

8 citations · 26 across the 13 of their papers we have counts for

collaborators

Showing 2021Show all

2 papers · 1 filter

math.CO2021

On the average order of a dominating set of a forest

Aysel Erey

We show that the average order of a dominating set of a forest graph $G$ on $n$ vertices with no isolated vertices is at most $2 n /3$ . Moreover, the equality is achieved if and only…

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.