S. Nasserasr

activity

20112026

most citedReconfiguration of Colourings and Dominating Sets in Graphs: a Survey

6 citations · 10 across the 14 of their papers we have counts for

collaborators

Showing 2020Show all

3 papers · 1 filter

math.CO2020

Colourings of $(m, n)$ -coloured mixed graphs

Gary MacGillivray, Shahla Nasserasr, Feiran Yang

A mixed graph is, informally, an object obtained from a simple undirected graph by choosing an orientation for a subset of its edges. A mixed graph is $(m, n)$ -coloured if each edg…

math.CO2020★ 6 cited

Reconfiguration of Colourings and Dominating Sets in Graphs: a Survey

C. M. Mynhardt, S. Nasserasr

We survey results concerning reconfigurations of colourings and dominating sets in graphs. The vertices of the $k$ -colouring graph $C_{k} (G)$ of a graph $G$ correspond to…

math.CO2020★ 1 cited

Complex Hadamard Diagonalisable Graphs

Ada Chan, Shaun Fallat, Steve Kirkland +3

In light of recent interest in Hadamard diagonalisable graphs (graphs whose Laplacian matrix is diagonalisable by a Hadamard matrix), we generalise this notion from real to complex…

Colourings of (m,n)-coloured mixed graphs

Reconfiguration of Colourings and Dominating Sets in Graphs: a Survey

Complex Hadamard Diagonalisable Graphs

Colourings of $(m, n)$ -coloured mixed graphs