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 20 of 43 for “"minimum rank"”.

  1. Haemers' Minimum Rank

    <p>Haemers' minimum rank was first defined by Willem Haemers in 1979. He created this graph parameter as an upper bound for the Shannon capacity of a graph, and to answer some questions asked by Lovasz in his famous paper where he determined the Shannon capacity of a 5-cycle.</p> <p>In this thesis, …

    iastate Repository record for Haemers' Minimum Rank (opens in a new tab)

  2. Minimum Rank Problems for Cographs

    … corresponding to the edges of G. The smallest rank achieved by a matrix in S(G) is called the minimum rank of G, denoted mr(G). The maximum nullity achieved by a matrix in S(G) is denoted M(G). For each graph G, there is an associated minimum rank class, MR(G) consisting of all matrices A in …

    byu Repository record for Minimum Rank Problems for Cographs (opens in a new tab) Download PDF for Minimum Rank Problems for Cographs (opens in a new tab)

  3. The Minimum Rank of Schemes on Graphs

    … if there exists a matrix A ∈ Sf (G) with rank A = min{rank M|M ∈ S(G)}. We explore properties of constructible schemes and give a complete classification of which schemes are constructible for paths and cycles. We also consider schemes on complete graphs and show the existence of a graph …

    byu Repository record for The Minimum Rank of Schemes on Graphs (opens in a new tab) Download PDF for The Minimum Rank of Schemes on Graphs (opens in a new tab)

  4. The Minimum Rank Problem for Outerplanar Graphs

    … if and only if ij is in E(G). The range of the ranks of matrices in S(G) is of interest and can be determined by finding the minimum rank. The minimum rank of a graph, denoted mr(G), is the minimum rank achieved by a matrix in S(G). The maximum nullity of a graph, denoted M(G), is the maximum …

    byu Repository record for The Minimum Rank Problem for Outerplanar Graphs (opens in a new tab) Download PDF for The Minimum Rank Problem for Outerplanar Graphs (opens in a new tab)

  5. The Minimum Rank Problem Over Finite Fields

    … minimal forbidden subgraph for the graphs having minimum rank at most 3 over the finite field of order 2. We also list all 62 such minimal forbidden subgraphs and show that many of these are minimal forbidden subgraphs for any field. Our second main result is a structural characterization of all …

    byu Repository record for The Minimum Rank Problem Over Finite Fields (opens in a new tab) Download PDF for The Minimum Rank Problem Over Finite Fields (opens in a new tab)

  6. Minimum rank of graphs that allow loops

    <p>The traditional "minimum rank problem" for simple graphs associates a set of symmetric matrices, the zero-nonzero pattern of whose off-diagonal entries are described by the graph, over a particular field and asks us to find the minimum among the ranks of the matrices in that set. Given a simple …

    iastate Repository record for Minimum rank of graphs that allow loops (opens in a new tab)

  7. A fractional approach to minimum rank and zero forcing

    … versions of graph parameters related to minimum rank and zero forcing. Projective rank, a graph parameter with applications to quantum information, is formally related to $r$-fold generalizations of orthogonal representations for graphs. Using similar techniques, fractional minimum …

    iastate Repository record for A fractional approach to minimum rank and zero forcing (opens in a new tab)

  8. The Minimum Rank, Inverse Inertia, and Inverse Eigenvalue Problems for Graphs

    … is described by G. We show how to compute the minimum rank of all matrices in S(G) for a class of graphs called outerplanar graphs. In addition, we obtain results on the possible eigenvalues and possible inertias of matrices in S(G) for certain classes of graph G. We also obtain results …

    byu Repository record for The Minimum Rank, Inverse Inertia, and Inverse Eigenvalue Problems for Graphs (opens in a new tab) Download PDF for The Minimum Rank, Inverse Inertia, and Inverse Eigenvalue Problems for Graphs (opens in a new tab)

  9. On the minimum rank of certain graphs with path cover number 2

    The minimum rank problem is an interesting and ongoing problem in spectral graph theory which seeks to answer the question "Given a simple graph G what is the minimum rank of a matrix whose off-diagonal zero/nonzero pattern is described by G?" In recent years, the minimum rank of trees, unicyclic …

    utc Repository record for On the minimum rank of certain graphs with path cover number 2 (opens in a new tab)

  10. Variants of zero forcing and their applications to the minimum rank problem

    <p>The minimum rank problem refers to finding the smallest possible rank, or equivalently the largest possible nullity, among matrices under certain restrictions. These restrictions can be the zero-nonzero pattern, conditions on the inertia, or other properties of a matrix. Zero forcing is a …

    iastate Repository record for Variants of zero forcing and their applications to the minimum rank problem (opens in a new tab)

  11. Diagonal Entry Restrictions in Minimum Rank Matrices, and the Inverse Inertia and Eigenvalue Problems for Graphs

    … be defined as the set of matrices in SF(G) whose rank achieves the minimum of the ranks of matrices in SF(G). We develop techniques involving Z-hat, a process termed nil forcing, and induced subgraphs, that can determine when diagonal entries corresponding to specific vertices of G must be zero or …

    byu Repository record for Diagonal Entry Restrictions in Minimum Rank Matrices, and the Inverse Inertia and Eigenvalue Problems for Graphs (opens in a new tab) Download PDF for Diagonal Entry Restrictions in Minimum Rank Matrices, and the Inverse Inertia and Eigenvalue Problems for Graphs (opens in a new tab)

  12. On a graph parameter related to vertex labelings and its application to minimum rank problems in graph theory

    This thesis regards the minimum rank and minimum positive semidefinite rank of a simple graph. A graph parameter, called the minimum labeling degree (mld), is defined in terms of the concept of a vertex labeling of a graph, and its value is calculated for a few graph classes. It is proved here that …

    utc Repository record for On a graph parameter related to vertex labelings and its application to minimum rank problems in graph theory (opens in a new tab)

  13. On the δ-conjecture for graphs with minimum degree |G| – 4

    For a graph G of order n, the minimum rank of G is defined to be the minimum rank among all n × n symmetric matrices whose ij-entry is nonzero precisely when {i, j} is an edge of G. The delta conjecture proposes a relationship between the minimum rank and the minimum degree of a given graph. We …

    utc Repository record for On the δ-conjecture for graphs with minimum degree |G| – 4 (opens in a new tab)

  14. A Natural Rank Problem for Homogeneous Polynomials and Connections with the Theory of Functions of Several Complex Variables

    … with the zero polynomial. We define the {\it rank} of a polynomial to be the number of distinct monomials appearing in the polynomial with non-zero coefficient. We are particularly interested in those homogeneous polynomials whose quotient with the homogeneous polynomial $x_0+x_1+\cdots+x_n$ …

    montana Repository record for A Natural Rank Problem for Homogeneous Polynomials and Connections with the Theory of Functions of Several Complex Variables (opens in a new tab)

  15. A Natural Rank Problem for Homogeneous Polynomials and Connections with the Theory of Functions of Several Complex Variables

    … with the zero polynomial. We define the {\it rank} of a polynomial to be the number of distinct monomials appearing in the polynomial with non-zero coefficient. We are particularly interested in those homogeneous polynomials whose quotient with the homogeneous polynomial $x_0+x_1+\cdots+x_n$ …

    montana-tech Repository record for A Natural Rank Problem for Homogeneous Polynomials and Connections with the Theory of Functions of Several Complex Variables (opens in a new tab)

  16. Counting Threshold Graphs and Finding Inertia Sets

    … present an algorithmic approach to finding the minimum rank of threshold graphs and then progress to counting the number of threshold graphs with a specific minimum rank. Second, we find an algorithmic and more automated way of determining the inertia set of graphs with seven or fewer vertices …

    byu Repository record for Counting Threshold Graphs and Finding Inertia Sets (opens in a new tab) Download PDF for Counting Threshold Graphs and Finding Inertia Sets (opens in a new tab)

  17. A Vascular and Non-Vascular Flora of the McGee Creek Watershed, Mono County, California

    … (774 vascular, 196 non-vascular) and 1011 minimum-rank taxa (813 vascular, 198 nonvascular). Eighty-three percent of these species (84% of the minimum-rank taxa), including 93% of the rare or threatened species and 93% of the introduced species, were not documented within the watershed …

    claremont Repository record for A Vascular and Non-Vascular Flora of the McGee Creek Watershed, Mono County, California (opens in a new tab)

  18. A Vascular Flora of the Nopah Range, Inyo County, California

    … documenting 60 families, 198 genera, and 365 minimum-rank vascular plant taxa present in the study area. Twenty-nine minimum-rank taxa are listed as rare in California and 32 appear to have edaphic affinities, mainly to the abundant carbonate substrates present in the Nopah Range such as …

    claremont Repository record for A Vascular Flora of the Nopah Range, Inyo County, California (opens in a new tab)

  19. Contributions to Geometry and Graph Theory

    … of zero forcing was introduced by the AIM Minimum Rank - Special Graphs Work Group in 2007 as a way of determining bounds on the minimum rank of graphs. Later, Darren Row established results concerning the zero forcing numbers of graphs with a cut-vertex. We will extend his work by …

    unt Repository record for Contributions to Geometry and Graph Theory (opens in a new tab)

  20. Vascular Floristic Study of the Piute Mountains, Kern County, California

    … herbarium collections representing 704 minimum-rank taxa (species, subspecies, varieties, named hybrids). Despite previous botanical work, there were large spatial and temporal gaps in the collection history of the Piute Mountains, and many species collected in the past had not been …

    claremont Repository record for Vascular Floristic Study of the Piute Mountains, Kern County, California (opens in a new tab)

Page 1 of 3