Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 4 of 4
Full-Text Articles in Entire DC Network
An Application Of Matrices To The Spread Of The Covid 19, Selena Suarez
An Application Of Matrices To The Spread Of The Covid 19, Selena Suarez
Theses and Dissertations
We represented a restaurant seating arrangement using matrices by using 0 entry for someone without covid and 1 entry for someone with covid. Using the matrices we found the best seating arrangements to lessen the spread of covid. We also investigated if there was a factor needed to create a formula that could calculate the matrix that shows who would be affected with covid with each seating arrangement. However, there did not seem to be a clear pattern within the factors. Aside from covid applications, we also investigated the symmetries in seating arrangements and the possible combinations with these arrangements …
The Minimum Rank, Inverse Inertia, And Inverse Eigenvalue Problems For Graphs, Mark Condie Kempton
The Minimum Rank, Inverse Inertia, And Inverse Eigenvalue Problems For Graphs, Mark Condie Kempton
Theses and Dissertations
For a graph G we define S(G) to be the set of all real symmetric n by n matrices whose off-diagonal zero/nonzero pattern 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 concerning the relationship between two graph parameters, the zero forcing number and the path cover number, related to the minimum rank problem.
A Mathematical Model Of Adhesion Interactions Between Living Cells, Casey P. Johnson
A Mathematical Model Of Adhesion Interactions Between Living Cells, Casey P. Johnson
Theses and Dissertations
This thesis presents a simple force-based model of moving and interacting cells that incorporates a realistic description of cell adhesion and applies it to a system of spherical cells. In addition, several results in matrix theory are proved with the end of showing that the equations produced by the model uniquely determine the motion of the system or cells.
Ultraconnected And Critical Graphs, Jason Nicholas Grout
Ultraconnected And Critical Graphs, Jason Nicholas Grout
Theses and Dissertations
We investigate the ultraconnectivity condition on graphs, and provide further connections between critical and ultraconnected graphs in the positive definite partial matrix completion problem. We completely characterize when the join of graphs is ultraconnected, and prove that ultraconnectivity is preserved by Cartesian products. We completely characterize when adding a vertex to an ultraconnected graph preserves ultraconnectivity. We also derive bounds on the number of vertices which guarantee ultraconnectivity of certain classes of regular graphs. We give results from our exhaustive enumeration of ultraconnected graphs up to 11 vertices. Using techniques involving the Lovász theta parameter for graphs, we prove certain …