4 citations · 5 across the 6 of their papers we have counts for
9 papers
Inertias of Laplacian matrices of weighted signed graphs
Keivan Hassani Monfared, Gary MacGillivray, Dale D. Olesky +1
We study the sets of inertias achieved by Laplacian matrices of weighted signed graphs. First we characterize signed graphs with a unique Laplacian inertia. Then we show that there…
Community structure detection and evaluation during the pre- and post-ictal hippocampal depth recordings
Keivan Hassani Monfared, Kris Vasudevan, Jordan S. Farrell +1
Detecting and evaluating regions of brain under various circumstances is one of the most interesting topics in computational neuroscience. However, the majority of the studies on d…
Inverse Spectral Problems for Linked Vibrating Systems and Structured Matrix Polynomials
Keivan Hassani Monfared, Peter Lancaster
We show that for a given set of distinct real numbers and graphs on nodes, , there are real symmetric $n\times…
Existence of a Not Necessarily Symmetric Matrix with Given Distinct Eigenvalues and Graph
Keivan Hassani Monfared
For given k distinct complex conjugate pairs, l distinct real numbers, and a given graph G on 2k+l vertices with a matching of size at least k, we will show that there is a real ma…
Spectral characterization of matchings in graphs
Keivan Hassani Monfared, Sudipta Mallik
A spectral characterization of the matching number (the size of a maximum matching) of a graph is given. More precisely, it is shown that the graphs G of order n whose matching num…
The maximum multiplicity of an eigenvalue of symmetric matrices with a given graph
Keivan Hassani Monfared, Sudipta Mallik
For a graph G, M(G) denotes the maximum multiplicity occurring of an eigenvalue of a symmetric matrix whose zero-nonzero pattern is given by edges of G. We introduce two combinator…