S. Nasserasr

From MaRDI portal
Person:1649909

Available identifiers

zbMath Open nasserasr.shahlaMaRDI QIDQ1649909

List of research outcomes





PublicationDate of PublicationType
Well-forced graphs2024-12-09Paper
Spectral arbitrariness for trees fails spectacularly2024-10-08Paper
Strongly \(i\)-bicritical graphs2024-08-13Paper
The \(q\)-analogue of zero forcing for certain families of graphs2024-03-27Paper
The strong spectral property of graphs: graph operations and barbell partitions2024-02-15Paper
Well-forced graphs2023-12-21Paper
Regular graphs of degree at most four that allow two distinct eigenvalues2023-11-06Paper
Sparsity of graphs that allow two distinct eigenvalues2023-07-13Paper
Spectral arbitrariness for trees fails spectacularly2023-01-26Paper
Weakly Hadamard diagonalizable graphs2021-02-16Paper
Corrigendum to: ``Achievable multiplicity partitions in the inverse eigenvalue problem of a graph2021-01-14Paper
https://portal.mardi4nfdi.de/entity/Q51336512020-11-10Paper
Colourings of $(m, n)$-coloured mixed graphs2020-10-18Paper
Complex Hadamard diagonalisable graphs2020-08-31Paper
Reconfiguration of Colourings and Dominating Sets in Graphs: a Survey2020-03-12Paper
Achievable multiplicity partitions in the inverse eigenvalue problem of a graph2020-02-26Paper
Rigid linkages and partial zero forcing2019-07-11Paper
https://portal.mardi4nfdi.de/entity/Q46226312019-02-13Paper
Reconfiguring minimum dominating sets: the \(\gamma\)-graph of a tree2018-06-29Paper
Integer solutions to \(x^2+ y^2= z^2-k\) for a fixed integer value \(k\)2017-06-14Paper
TP_k completions of partial matrices with one unspecified entry2015-08-14Paper
Complete solution to the TP2completion problem2014-11-12Paper
https://portal.mardi4nfdi.de/entity/Q52989182013-06-25Paper
The minimum rank of universal adjacency matrices2012-09-06Paper
Totally positive shapes and \(TP_{k}\)-completable patterns2012-05-14Paper
TP\(_2\) = Bruhat2010-05-05Paper
Primitive digraphs with smallest large exponent2008-03-14Paper

Research outcomes over time

This page was built for person: S. Nasserasr