scientific article; zbMATH DE number 798644

zbMath0832.05027MaRDI QIDQ4848766

Gayla S. Domke, Jean H. Bevis, Valerie A. Miller

Publication date: 20 September 1995

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

treeranklinear time algorithmgrid graphedge independence number

Mathematics Subject Classification ID

Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (12)

Behavior of the binary rank of a graph when vertices and edges are added ⋮ The determinant of a tree's neighborhood matrix ⋮ The rank of a graph after vertex addition ⋮ Independence and matching numbers of unicyclic graphs from null space ⋮ Trees with a unique maximum independent set and their linear properties ⋮ Null decomposition of trees ⋮ Singular distance powers of circuits ⋮ Null decomposition of bipartite graphs without cycles of length 0 modulo 4 ⋮ Nullspace vertex partition in graphs ⋮ Tree decomposition by eigenvectors ⋮ The determinant of a unicyclic graph's neighborhood matrix ⋮ Two-colorable graph states with maximal Schmidt measure

This page was built for publication: