scientific article; zbMATH DE number 798644

MaRDI QIDQ4848766zbMATH OpenFDO

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

Publication date 20 September 1995

zbMATH Keywords

edge independence numbergrid graphlinear time algorithmranktree

Mathematics Subject Classification ID

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

Recommendations

• Rank numbers of grid graphs
• On an edge ranking problem of trees and graphs
• Rank numbers for some trees and unicyclic graphs
• Maximum order of trees and bipartite graphs with a given rank
• The Rank-Width of the Square Grid

Cited in

(16)

• Two-colorable graph states with maximal Schmidt measure
• The determinant of a tree's neighborhood matrix
• The rank of a graph after vertex addition
• On ranks of matrices associated with trees
• Null decomposition of trees
• The determinant of a unicyclic graph's neighborhood matrix
• Behavior of the binary rank of a graph when vertices and edges are added
• Independence and matching numbers of unicyclic graphs from null space
• Null decomposition of bipartite graphs without cycles of length 0 modulo 4
• Nullspace vertex partition in graphs
• scientific article; zbMATH DE number 139900 (Why is no real title available?)
• Trees with a unique maximum independent set and their linear properties
• On the core-nilpotent decomposition of unicyclic graphs
• Rank numbers of grid graphs
• Singular distance powers of circuits
• Tree decomposition by eigenvectors

This page was built for publication:

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