Spectral characterization of tree-width-two graphs

DOI10.1007/S004930070038MaRDI QIDQ5932703zbMATH OpenOpenAlexFDO

Authors Andreĭ V. Kotlov

Publication date 13 June 2001

Published in Combinatorica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s004930070038

zbMATH Keywords

tree-width-two graphs

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75)

Recommendations

• Tree width and regular triangulations
• The Colin de Verdière parameter, excluded minors, and the spectral radius
• Two tree-width-like graph invariants
• On the ?largeur d'arborescence?
• On the Colin de Verdière number of graphs

Cited in

(9)

• Some connectivity properties for excluded minors of the graph invariant (G)
• Graphs whose positive semi-definite matrices have nullity at most two
• The inertia set of a signed graph
• On the ?largeur d'arborescence?
• Parameters related to tree-width, zero forcing, and maximum nullity of a graph
• Tree width and regular triangulations
• Two tree-width-like graph invariants
• Forbidden minor characterizations for low-rank optimal solutions to semidefinite programs over the elliptope
• Signed graphs whose signed Colin de Verdière parameter is two

This page was built for publication: Spectral characterization of tree-width-two graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5932703)