Multiplicities of eigenvalues and tree-width of graphs
From MaRDI portal
Publication:1569029
DOI10.1006/jctb.1998.1834zbMath1027.05064OpenAlexW2038713190MaRDI QIDQ1569029
Publication date: 25 June 2000
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/5ded568897ef1e2943e68d91e7745596025ca98b
Planar graphs; geometric and topological aspects of graph theory (05C10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Related Items
Throttling for Zero Forcing and Variants ⋮ Generalizations of the strong Arnold property and the minimum number of distinct eigenvalues of a graph ⋮ The rotational dimension of a graph ⋮ Using a new zero forcing process to guarantee the strong Arnold property ⋮ Symplectic geometry, minors and graph Laplacians ⋮ The inertia set of a signed graph ⋮ Various characterizations of throttling numbers ⋮ Forbidden minors for the class of graphs \(G\) with \(\xi (G) \leqslant 2\) ⋮ Some recent progress and applications in graph minor theory ⋮ Achievable sets, brambles, and sparse treewidth obstructions ⋮ Optimizing Colin de Verdière matrices of \(K_{4,4}\) ⋮ Signed graphs whose signed Colin de Verdière parameter is two ⋮ Graph Searching in a Crime Wave ⋮ The mixed search game against an agile and visible fugitive is monotone ⋮ Vertex and edge spread of zero forcing number, maximum nullity, and minimum rank of a graph ⋮ On the graph complement conjecture for minimum rank ⋮ Computing inertia sets using atoms ⋮ The minimum semidefinite rank of the complement of partial \(k\)-trees ⋮ Linkless and flat embeddings in 3-space ⋮ On the Colin de Verdière number of graphs ⋮ The minimum semidefinite rank of a triangle-free graph ⋮ Some connectivity properties for excluded minors of the graph invariant \(\nu(G)\) ⋮ Graphs whose positive semi-definite matrices have nullity at most two ⋮ Parameters Tied to Treewidth ⋮ Unnamed Item ⋮ Essential self-adjointness for combinatorial Schrödinger operators. III: Magnetic fields ⋮ Positive semidefinite matrix completion, universal rigidity and the strong Arnold property ⋮ Three-connected graphs whose maximum nullity is at most three ⋮ Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph ⋮ A new graph parameter related to bounded rank positive semidefinite matrix completions ⋮ Expected values of parameters associated with the minimum rank of a graph ⋮ On the graph complement conjecture for minimum semidefinite rank ⋮ Zero forcing parameters and minimum rank problems ⋮ The minimum rank of symmetric matrices described by a graph: a survey ⋮ Forbidden minor characterizations for low-rank optimal solutions to semidefinite programs over the elliptope ⋮ Discrete holomorphic geometry I. Darboux transformations and spectral curves ⋮ Unnamed Item ⋮ Fresnel integrals and determinants ⋮ Complexity of the Positive Semidefinite Matrix Completion Problem with a Rank Constraint ⋮ Graphs with magnetic Schrödinger operators of low corank ⋮ Graph complement conjecture for classes of shadow graphs
Cites Work
- Graph minors. III. Planar tree-width
- Berger's isoperimetric problem and minimal immersions of surfaces
- Eigenfunctions and nodal sets
- Fluxes, Laplacians, and Kasteleyn's theorem
- Planar electric networks. I
- Sur un nouvel invariant des graphes et un critère de planarité. (On a new graph invariant and a planarity criterion)
- A short proof of the planarity characterization of Colin de Verdière
- Planar electric networks. II
- Graph minors. IV: Tree-width and well-quasi-ordering
- Multiplicités des valeurs propres et transformations étoile-triangle des graphes
- Fourier integral operators
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
