Hein van der Holst

Hein van der Holst

Auto-generated profile, based on publicly available information

Hein van der Holst

Department of Mathematics and Statistics, Georgia State University, Atlanta, GA 30303, USA

Research Focus & Metrics

Academic Career Length

32Years (1995-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 August 2010 in Linear Algebra and its Applications
Verified
Journal Article
Closed access
FBFrancesco Barioli
Francesco Barioli
WBWayne Barrett
Wayne Barrett
SFShaun M. Fallat
Shaun M. Fallat
HHH. Tracy Hall
H. Tracy Hall
LHLeslie Hogben
Leslie Hogben
HHHein van der Holst
Hein van der Holst

18 June 2012 in Journal of Graph Theory
Verified
Journal Article
Closed access
PDF file
FBFrancesco Barioli
Francesco Barioli
WBWayne Barrett
Wayne Barrett
SFShaun Fallat
Shaun Fallat
HHH. Tracy Hall
H. Tracy Hall
LHLeslie Hogben
Leslie Hogben
HHHein van der Holst
Hein van der Holst

1 January 2004 in The Electronic Journal of Linear Algebra
Verified
Journal Article
Closed access
PDF file
WBWayne Barrett
Wayne Barrett
HHHein Van der Holst
Hein Van der Holst
RLRaphael Loewy
Raphael Loewy
Let F be a field, G =( V, E) be an undirected graph on n vertices, and let S(F, G) be the set of all symmetric n × n matrices whose nonzero off-diagonal entries occur in exactly the positions corresponding to the edges of G. For example, if G is a path, S(F, G )co nsists of the symmetric irreducible tridiagonal matrices. Let mr(F, G) be the minimum rank over all matrices in S(F, G). Then mr(F, G) = 1 if and only if G is the union of a clique with at least 2 vertices and an independent set. If F is an infinite field such that charF � =2 , then mr(F, G) ≤ 2i f and only if the complement of G is the join of a clique and a graph that is the union of at most two cliques and any number of complete bipartite graphs. A similar result is obtained in the case that F is an infinite field with char F = 2. Furthermore, in each case, such graphs are characterized as those for which 6 specific graphs do not occur as induced subgraphs. The number of forbidden subgraphs is reduced to 4 if the graph is connected. Finally, similar criteria is obtained for the minimum rank of a Hermitian matrix to be less than or equal to two. The complement is the join of a clique and a graph that is the union of any number of cliques and any number of complete bipartite graphs. The number of forbidden subgraphs is now 5, or in the connected case, 3.

29 October 2003 in Linear Algebra and its Applications
Verified
Journal Article
Closed access
PDF file
MAMartin Aigner
Martin Aigner
HHHein van der Holst
Hein van der Holst

1 January 2009 in The Electronic Journal of Linear Algebra
Verified
Journal Article
Closed access
PDF file
FBFrancesco Barioli
Francesco Barioli
SFShaun Fallat
Shaun Fallat
HHH. Hall
H. Hall
DHDaniel Hershkowitz
Daniel Hershkowitz
LHLeslie Hogben
Leslie Hogben
BSBryan Shader
Bryan Shader

21 October 2003 in Linear Algebra and its Applications
Verified
Journal Article
Closed access
PDF file
HHHein van der Holst
Hein van der Holst