| Publication | Date of Publication | Type |
|---|
Graphs with bipartite complement that admit two distinct eigenvalues
ELA. The Electronic Journal of Linear Algebra | 2026-03-11 | Paper |
Colourings of (m, n)-coloured mixed graphs
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2026-01-23 | Paper |
Well-forced graphs
Graphs and Combinatorics | 2024-12-09 | Paper |
Spectral arbitrariness for trees fails spectacularly
Journal of Combinatorial Theory. Series B | 2024-10-08 | Paper |
Strongly i-bicritical graphs
Theory and Applications of Graphs | 2024-08-13 | Paper |
The \(q\)-analogue of zero forcing for certain families of graphs
Discrete Applied Mathematics | 2024-03-27 | Paper |
The strong spectral property of graphs: graph operations and barbell partitions
Graphs and Combinatorics | 2024-02-15 | Paper |
Graphs with Bipartite Complement that Admit Two Distinct Eigenvalues
(available as arXiv preprint) | 2024-01-01 | Paper |
| Well-forced graphs | 2023-12-21 | Paper |
Regular graphs of degree at most four that allow two distinct eigenvalues
Linear Algebra and its Applications | 2023-11-06 | Paper |
Sparsity of graphs that allow two distinct eigenvalues
Linear Algebra and its Applications | 2023-07-13 | Paper |
| Spectral arbitrariness for trees fails spectacularly | 2023-01-26 | Paper |
Weakly Hadamard diagonalizable graphs
Linear Algebra and its Applications | 2021-02-16 | Paper |
Corrigendum to: ``Achievable multiplicity partitions in the inverse eigenvalue problem of a graph''
Special Matrices | 2021-01-14 | Paper |
| scientific article; zbMATH DE number 7272506 (Why is no real title available?) | 2020-11-10 | Paper |
| Colourings of $(m, n)$-coloured mixed graphs | 2020-10-18 | Paper |
Complex Hadamard diagonalisable graphs
Linear Algebra and its Applications | 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
Special Matrices | 2020-02-26 | Paper |
Complex Hadamard Diagonalisable Graphs
(available as arXiv preprint) | 2020-01-01 | Paper |
Reconfiguration of Colourings and Dominating Sets in Graphs: a Survey
(available as arXiv preprint) | 2020-01-01 | Paper |
Rigid linkages and partial zero forcing
The Electronic Journal of Combinatorics | 2019-07-11 | Paper |
Rigid linkages and partial zero forcing
The Electronic Journal of Combinatorics | 2019-07-11 | Paper |
| Independent domination bicritical graphs | 2019-02-13 | Paper |
Reconfiguring minimum dominating sets: the -graph of a tree
Discussiones Mathematicae Graph Theory | 2018-06-29 | Paper |
Integer solutions to \(x^2+ y^2= z^2-k\) for a fixed integer value \(k\)
Involve | 2017-06-14 | Paper |
TP_k completions of partial matrices with one unspecified entry
The Electronic Journal of Linear Algebra | 2015-08-14 | Paper |
Complete solution to the \(TP_{2}\) completion problem
Linear and Multilinear Algebra | 2014-11-12 | Paper |
| On the null space structure associated with trees and cycles | 2013-06-25 | Paper |
The minimum rank of universal adjacency matrices
Linear Algebra and its Applications | 2012-09-06 | Paper |
Totally positive shapes and \(TP_{k}\)-completable patterns
Linear Algebra and its Applications | 2012-05-14 | Paper |
TP\(_2\) = Bruhat
Discrete Mathematics | 2010-05-05 | Paper |
Primitive digraphs with smallest large exponent
Linear Algebra and its Applications | 2008-03-14 | Paper |
