SNShahla Nasserasr

Shahla Nasserasr

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Shahla Nasserasr has a total of 8 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Reconfiguration of Colourings and Dominating Sets in Graphs: a Survey

    by C. M. Mynhardt, S. Nasserasr

    We survey results concerning reconfigurations of colourings and dominating sets in graphs. The vertices of the $k$-colouring graph $\mathcal{C}_{k}(G)$ of a graph $G$ correspond to the proper $k$-colourings of a graph $G$, with two $k$-colourings being adjacent whenever they differ in the colour of exactly one vertex. Similarly, the vertices of the $k$-edge-colouring graph $\mathcal{EC}_{k}(G)$ of $g$ are the proper $k$-edge-colourings of $G$, where two $k$-edge-colourings are adjacent if one can be obtained from the other by switching two colours along an edge-Kempe chain, i.e., a maximal two-coloured alternating path or cycle of edges. The vertices of the $k$-dominating graph $\mathcal{D}_{k}(G)$ are the (not necessarily minimal) dominating sets of $G$ of cardinality $k$ or less, two dominating sets being adjacent in $\mathcal{D}_{k}(G)$ if one can be obtained from the other by adding or deleting one vertex. On the other hand, when we restrict the dominating sets to be minimum dominating sets, for example, we obtain different types of domination reconfiguration graphs, depending on whether vertices are exchanged along edges or not. We consider these and related types of colouring and domination reconfiguration graphs. Conjectures, questions and open problems are stated within the relevant sections.

  • Open Access

    Rigid Linkages and Partial Zero Forcing

    by Daniela Ferrero, Mary Flagg, H. Tracy Hall, Leslie Hogben, Jephian C.-H. Lin, Seth A. Meyer, Shahla Nasserasr, Bryan Shader

    Connections between vital linkages and zero forcing are established. Specifically, the notion of a rigid linkage is introduced as a special kind of unique linkage and it is shown that spanning forcing paths of a zero forcing process form a spanning rigid linkage and thus a vital linkage. A related generalization of zero forcing that produces a rigid linkage via a coloring process is developed. One of the motivations for introducing zero forcing is to provide an upper bound on the maximum multiplicity of an eigenvalue among the real symmetric matrices described by a graph. Rigid linkages and a related notion of rigid shortest linkages are utilized to obtain bounds on the multiplicities of eigenvalues of this family of matrices.