K
Kate Lorenzen
Researcher at Iowa State University
Publications - 8
Citations - 73
Kate Lorenzen is an academic researcher from Iowa State University. The author has contributed to research in topics: Laplacian matrix & Distance matrix. The author has an hindex of 4, co-authored 7 publications receiving 58 citations.
Papers
More filters
Journal ArticleDOI
Throttling positive semidefinite zero forcing propagation time on graphs
Joshua Carlson,Leslie Hogben,Leslie Hogben,Jürgen Kritschgau,Kate Lorenzen,Michael S. Ross,Seth Selken,Vicente Valle Martinez +7 more
TL;DR: A tight lower bound is established on the positive semidefinite throttling number of the graph as a function of the order, maximum degree, and positive semidescendent zero forcing number.
Journal ArticleDOI
Graphs that are cospectral for the distance Laplacian
Boris Brimkov,Ken Duna,Leslie Hogben,Kate Lorenzen,Carolyn Reinhart,Sung-Yell Song,Mark Yarrow +6 more
TL;DR: In this paper, it was shown that the absolute values of coefficients of the distance Laplacian characteristic polynomial are decreasing, i.e., the absolute value of the coefficient is decreasing for strongly regular and circulant strongly regular cospectral graphs.
Journal ArticleDOI
r-hued coloring of sparse graphs
TL;DR: In this paper, the following results are proved using the well-known discharging method: the maximum average degree of G, denoted by mad ( G ), equals max.
Journal ArticleDOI
Computing Kemeny's constant for a barbell graph
TL;DR: In this article, the largest possible order of Kemeny's constant for a graph on n vertices is given for graphs of order n consisting of two large cliques joined by an arbitrary number of parallel paths of equal length.
Posted Content
Cospectral constructions for several graph matrices using cousin vertices
TL;DR: In this article, the authors generalized a construction for cospectral graphs previously given for the distance Laplacian matrix to a larger family of graphs and showed that with appropriate assumptions this generalized construction extends to the adjacency matrix.