The following pages link to Shahla Nasserasr (Q1649909):
Displayed 24 items.
- (Q448354) (redirect page) (← links)
- The minimum rank of universal adjacency matrices (Q448355) (← links)
- TP\(_2\) = Bruhat (Q968441) (← links)
- Reconfiguring minimum dominating sets: the \(\gamma\)-graph of a tree (Q1649910) (← links)
- Rigid linkages and partial zero forcing (Q2001975) (← links)
- Complex Hadamard diagonalisable graphs (Q2197273) (← links)
- Corrigendum to: ``Achievable multiplicity partitions in the inverse eigenvalue problem of a graph'' (Q2217786) (← links)
- Weakly Hadamard diagonalizable graphs (Q2228102) (← links)
- Achievable multiplicity partitions in the inverse eigenvalue problem of a graph (Q2302881) (← links)
- Integer solutions to \(x^2+ y^2= z^2-k\) for a fixed integer value \(k\) (Q2357683) (← links)
- Primitive digraphs with smallest large exponent (Q2477548) (← links)
- Complete solution to the TP<sub>2</sub>completion problem (Q2929480) (← links)
- (Q4622631) (← links)
- (Q5133651) (← links)
- (Q5298918) (← links)
- TP_k completions of partial matrices with one unspecified entry (Q5501679) (← links)
- Regular graphs of degree at most four that allow two distinct eigenvalues (Q6084879) (← links)
- The \(q\)-analogue of zero forcing for certain families of graphs (Q6124425) (← links)
- The strong spectral property of graphs: graph operations and barbell partitions (Q6154374) (← links)
- Sparsity of graphs that allow two distinct eigenvalues (Q6173926) (← links)
- Reconfiguration of Colourings and Dominating Sets in Graphs: a Survey (Q6336646) (← links)
- Colourings of $(m, n)$-coloured mixed graphs (Q6351599) (← links)
- Spectral arbitrariness for trees fails spectacularly (Q6424461) (← links)
- Well-forced graphs (Q6464684) (← links)