J
Jason Grout
Researcher at Drake University
Publications - 19
Citations - 2375
Jason Grout is an academic researcher from Drake University. The author has contributed to research in topics: Rank (graph theory) & Matrix (mathematics). The author has an hindex of 10, co-authored 19 publications receiving 1649 citations. Previous affiliations of Jason Grout include Brigham Young University & Iowa State University.
Papers
More filters
Proceedings ArticleDOI
Jupyter Notebooks – a publishing format for reproducible computational workflows
Thomas Kluyver,Benjamin Ragan-Kelley,Fernando Perez,Brian E. Granger,Matthias Bussonnier,Jonathan Frederic,Kyle Kelley,Jessica B. Hamrick,Jason Grout,Sylvain Corlay,Paul Ivanov,Damián Avila,Safia Abdalla,Carol Willing +13 more
TL;DR: Jupyter notebooks, a document format for publishing code, results and explanations in a form that is both readable and executable, is presented.
Journal ArticleDOI
A Construction of Cospectral Graphs for the Normalized Laplacian
Steve Butler,Jason Grout +1 more
TL;DR: In this paper, a method to construct cospectral graphs for the normalized Laplacian by a local modification in some graphs with special structure is presented. But the method requires the modification of the spectrum of the entire graph, not only for bipartite graphs, but also for non-bipartite, non-regular graphs.
Journal ArticleDOI
Minimum rank of skew-symmetric matrices described by a graph
Mary Allison,Elizabeth Bodine,Luz Maria DeAlba,Joyati Debnath,Laura DeLoss,Colin Garnett,Jason Grout,Leslie Hogben,Bokhee Im,Hana Kim,Reshmi Nair,Olga Pryporova,Kendrick Savage,Bryan L. Shader,Amy Wangsness Wehe +14 more
TL;DR: The minimum skew rank of a simple graph G over a field F is the smallest possible rank among all skew-symmetric matrices over F whose ijth entry (for i 6 = j) is nonzero whenever {i, j} is an edge in G and is zero otherwise as discussed by the authors.
Journal ArticleDOI
Techniques for determining the minimum rank of a small graph
TL;DR: A program is developed using the open-source mathematics software Sage to implement several techniques for computation of minimum rank and these techniques have been used to determine the minimum ranks of all graphs of order 7.
Posted Content
The minimum rank problem over the finite field of order 2: minimum rank 3
TL;DR: In this article, a sharp bound for the number of vertices in a minimal forbidden subgraph for the graphs having minimum rank at most 3 over the finite field of order 2 was established.