S. Nasserasr

Available identifiers

zbMath Open nasserasr.shahlaMaRDI QIDQ1649909

List of research outcomes

Publication	Date of Publication	Type
Well-forced graphs	2024-12-09	Paper
Spectral arbitrariness for trees fails spectacularly	2024-10-08	Paper
Strongly $i$-bicritical graphs	2024-08-13	Paper
The $q$-analogue of zero forcing for certain families of graphs	2024-03-27	Paper
The strong spectral property of graphs: graph operations and barbell partitions	2024-02-15	Paper
Well-forced graphs	2023-12-21	Paper
Regular graphs of degree at most four that allow two distinct eigenvalues	2023-11-06	Paper
Sparsity of graphs that allow two distinct eigenvalues	2023-07-13	Paper
Spectral arbitrariness for trees fails spectacularly	2023-01-26	Paper
Weakly Hadamard diagonalizable graphs	2021-02-16	Paper
Corrigendum to: ``Achievable multiplicity partitions in the inverse eigenvalue problem of a graph	2021-01-14	Paper
https://portal.mardi4nfdi.de/entity/Q5133651	2020-11-10	Paper
Colourings of $(m, n)$-coloured mixed graphs	2020-10-18	Paper
Complex Hadamard diagonalisable graphs	2020-08-31	Paper
Reconfiguration of Colourings and Dominating Sets in Graphs: a Survey	2020-03-12	Paper
Achievable multiplicity partitions in the inverse eigenvalue problem of a graph	2020-02-26	Paper
Rigid linkages and partial zero forcing	2019-07-11	Paper
https://portal.mardi4nfdi.de/entity/Q4622631	2019-02-13	Paper
Reconfiguring minimum dominating sets: the $\gamma$-graph of a tree	2018-06-29	Paper
Integer solutions to $x^2+ y^2= z^2-k$ for a fixed integer value $k$	2017-06-14	Paper
TP_k completions of partial matrices with one unspecified entry	2015-08-14	Paper
Complete solution to the TP₂completion problem	2014-11-12	Paper
https://portal.mardi4nfdi.de/entity/Q5298918	2013-06-25	Paper
The minimum rank of universal adjacency matrices	2012-09-06	Paper
Totally positive shapes and $TP_{k}$-completable patterns	2012-05-14	Paper
TP$_2$ = Bruhat	2010-05-05	Paper
Primitive digraphs with smallest large exponent	2008-03-14	Paper

Research outcomes over time

This page was built for person: S. Nasserasr