Aysel Erey

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

In this paper, we investigate various algebraic and graph theoretic properties of the distance matrix of a graph. Two graphs are

Block decomposition approach to compute a minimum geodetic set

D

Computing minimum geodetic sets of proper interval graphs

-cospectral if their distance matrices have the same spectrum. We construct infinite pairs of

New bounds for chromatic polynomials and chromatic roots

D

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

-cospectral graphs with different diameter and different Wiener index. A graph is

On the Roots of σ‐Polynomials

k

Extremal Colorings and Independent Sets

-transmission-regular if its distance matrix has constant row sum equal to

Restraints permitting the largest number of colourings

k

On the maximum number of colorings of a graph

. We establish tight upper and lower bounds for the row sum of a

Extremal Restraints for Graph Colourings

k