The minimum semidefinite rank of the complement of partial \(k\)-trees
type: Item
instance of: scholarly article
title: The minimum semidefinite rank of the complement of partial \(k\)-trees
zbMATH Open document ID: 1213.05173
author: John Sinkovic
author: Hein van der Holst
published in: Linear Algebra and its Applications
publication date: 2011-03-04T00:00:00Z
Mathematics Subject Classification ID: 05C50
Mathematics Subject Classification ID: 15A03
Mathematics Subject Classification ID: 15A18
zbMATH DE Number: 5860477
zbMATH Keywords: minimum rank
zbMATH Keywords: orthogonal representation
zbMATH Keywords: partial \(k\)-trees
zbMATH Keywords: graph complement
MaRDI profile type: Publication
full work available at URL: j.laa.2010.11.013
OpenAlex ID: W2029574412
cites work: A variant on the graph parameters of Colin de Verdiere: Implications to the minimum rank of graphs
cites work: Graphs whose minimal rank is two
cites work: A partial k-arboretum of graphs with bounded treewidth
cites work: Sur une hypothèse de transversalité d'Arnold. (About a transversality hypothesis of Arnold)
cites work: Sur un nouvel invariant des graphes et un critère de planarité. (On a new graph invariant and a planarity criterion)
cites work: Q4273839
cites work: Multiplicities of eigenvalues and tree-width of graphs
cites work: Q4947393
cites work: The minimum rank of symmetric matrices described by a graph: a survey
cites work: Zero forcing sets and the minimum rank of graphs
cites work: Orthogonal representations, minimum rank, and graph complements
cites work: Three-connected graphs whose maximum nullity is at most three
cites work: The maximum multiplicity of an eigenvalue in a matrix whose graph is a tree
cites work: The Colin de Verdière number and sphere representations of a graph
cites work: Graph minors. XX: Wagner's conjecture
DOI: 10.1016/J.LAA.2010.11.013
description: scientific article; zbMATH DE number 5860477