S
Sebastian M. Cioabă
Researcher at University of Delaware
Publications - 94
Citations - 1638
Sebastian M. Cioabă is an academic researcher from University of Delaware. The author has contributed to research in topics: Adjacency matrix & Regular graph. The author has an hindex of 19, co-authored 91 publications receiving 1245 citations. Previous affiliations of Sebastian M. Cioabă include Microsoft & University of California, San Diego.
Papers
More filters
Journal ArticleDOI
Zero forcing sets and the minimum rank of graphs
Francesco Barioli,Wayne Barrett,Steve Butler,Sebastian M. Cioabă,Dragoš Cvetković,Shaun M. Fallat,Chris Godsil,Willem H. Haemers,Leslie Hogben,Rana Mikkelson,Sivaram K. Narayan,Olga Pryporova,Irene Sciriha,Wasin So,Dragan Stevanović,Hein van der Holst,Kevin N. Vander Meulen,Amy Wangsness Wehe +17 more
TL;DR: In this article, the minimum rank of a simple graph G is defined to be the smallest possible rank over all symmetric real matrices whose ijth entry (for i 6 j) is nonzero whenever {i,j} is an edge in G and is zero otherwise.
Journal ArticleDOI
Matchings in regular graphs from eigenvalues
TL;DR: A best upper bound is found on the third largest eigenvalue that is sufficient to guarantee that G has a perfect matching when n is even, and a matching of order n-1 whenn is odd.
Journal ArticleDOI
Skew-adjacency matrices of graphs
Michael S. Cavers,Sebastian M. Cioabă,Shaun M. Fallat,David A. Gregory,Willem H. Haemers,Steve Kirkland,Judith J. McDonald,Michael J. Tsatsomeros +7 more
TL;DR: In this paper, the spectra of the skew-adjacency matrices of a graph are considered as a possible way to distinguish adjacency cospectral graphs, and an analogue of the Perron-Frobenius theorem is proposed.
Journal ArticleDOI
Eigenvalues and edge-connectivity of regular graphs
TL;DR: In this paper, it was shown that if the second largest eigenvalue of a d-regular graph G is less than ρ ( d ), then G is 2 -edge-connected.
Journal ArticleDOI
Principal eigenvectors of irregular graphs
TL;DR: In this article, it is conjectured that for connected graphs of order n ≥ 3, the principal ratio is always attained by one of the lollipop graphs obtained by attaching a path graph to a vertex of a complete graph.