Author pages are created from data sourced from our academic publisher partnerships and public sources.

Publications Influence

Share This Author

Reconfiguring Minimum Dominating Sets: The γ-Graph of a Tree

- Michelle Edwards, G. MacGillivray, S. Nasserasr
- Computer Science, Mathematics
- Discuss. Math. Graph Theory
- 2018

TLDR

Minimum number of distinct eigenvalues of graphs

- Bahman Ahmadi, Fatemeh Alinaghipour, M. Cavers, Shaun M. Fallat, Karen Meagher, S. Nasserasr
- Mathematics
- 3 April 2013

The minimum number of distinct eigenvalues, taken over all real symmetric matrices compatible with a given graph G, is denoted by q(G). Using other parameters related to G, bounds for q(G) are proven… Expand

Reconfiguration of Colourings and Dominating Sets in Graphs

- C. Mynhardt, S. Nasserasr
- Computer Science, Mathematics
- 15 November 2019

TLDR

Totally positive shapes and TPk-completable patterns☆

- D. Hoff, Charles R. Johnson, S. Nasserasr
- Mathematics
- 15 June 2012

Abstract The notions of total positivity and of TP k are generalized to “shapes” (a generalization of matrices). In particular, the relationship between positivity of “contiguous” minors and all… Expand

Achievable multiplicity partitions in the inverse eigenvalue problem of a graph

- Mohammad Adm, Shaun M. Fallat, Karen Meagher, S. Nasserasr, S. Plosker, Boting Yang
- Mathematics
- 1 January 2019

Abstract Associated to a graph G is a set 𝒮(G) of all real-valued symmetric matrices whose off-diagonal entries are nonzero precisely when the corresponding vertices of the graph are adjacent, and… Expand

Note: TP2=Bruhat

- C. R. Johnson, S. Nasserasr
- Computer Science, Mathematics
- Discret. Math.
- 1 June 2010

It is shown that the Bruhat partial order on permutations is equivalent to a certain natural partial order induced by TP"2 matrices and that a positive matrix is TP"2 if (and only if) it satisfies… Expand

Corrigendum to “Achievable Multiplicity partitions in the Inverse Eigenvalue Problem of a graph” [Spec. Matrices 2019; 7:276-290.]

- Mohammad Adm, Shaun M. Fallat, Karen Meagher, S. Nasserasr, S. Plosker, Boting Yang
- Mathematics
- 1 January 2020

Abstract We correct an error in the original Lemma 3.4 in our paper “Achievable Multiplicity partitions in the IEVP of a graph”’ [Spec. Matrices 2019; 7:276-290.]. We have re-written Section 3… Expand

Complex Hadamard diagonalisable graphs

- Ada Chan, Shaun M. Fallat, S. Kirkland, Jephian C.-H. Lin, S. Nasserasr, S. Plosker
- Mathematics, Physics
- 1 January 2020

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 Hadamard matrices.… Expand

The logarithmic method and the solution to the TP2-completion problem

- S. Nasserasr
- Mathematics
- 2010

PAGE A matrix is called TP2 if all 1-by-1 and 2-by-2 minors are positive. A partial matrix is one with some of its entries specified, while the remaining, unspecified, entries are free to be chosen.… Expand

...

1

2

3

...