Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 1 of 1 for “"rank-spread"”.

  1. The Relationship Between the Minimal Rank of a Tree and the Rank-Spreads of the Vertices and Edges

    … to the edges of G. Let mr(F,G)be the minimum rank over all matrices in S(F,G). We give a field independent proof of a well-known result that for a tree the sum of its path cover number and minimal rank is equal to the number of vertices in the tree. The rank-spread of a vertex v of G is the …

    byu Repository record for The Relationship Between the Minimal Rank of a Tree and the Rank-Spreads of the Vertices and Edges (opens in a new tab)