**DECEMBER 12, 2023 20:00-21:20 (GMT+3)**

**Full list of titles and abstracts**

20:00 |
Edge Covers of the Fan Graph
A graph models relationships between discrete objects using vertices (dots) and edges (lines) connecting pairs of vertices. An edge cover of a graph is a subset of the graph’s edges chosen in a way so that each vertex is an endpoint of at least one edge in this subset. The numbers of edge covers for the graph families path and cycle graphs correspond to the well-known Fibonacci and Lucas numbers. A fan graph |

20:20 |
A graph is a mathematical representation of binary relations between discrete objects. An edge cover of a graph |

20:40 |
Edge Covers of Unions of Path and Cycle Graphs
An edge cover of a graph |

21:00 |
Edge Cover Polynomials
The edge cover polynomial is the generating polynomial of the number of edge covers of a graph. This polynomial counts the edge covers based on the number of edges in them. It is known that the edge cover polynomials of path and cycle graphs have real roots, making their coefficients to be log-concave and unimodal. We will present our results on edge cover polynomials of other graph families obtained by modifying path and cycle graphs after reviewing the relevant background. |

^{† }Grand Valley State University, Michigan, USA

^{‡ }Dokuz Eylül University, İzmir, Türkiye