Open Access. Powered by Scholars. Published by Universities.®
- Publication
- Publication Type
Articles 1 - 2 of 2
Full-Text Articles in Other Mathematics
The Mean Sum Of Squared Linking Numbers Of Random Piecewise-Linear Embeddings Of $K_N$, Yasmin Aguillon, Xingyu Cheng, Spencer Eddins, Pedro Morales
The Mean Sum Of Squared Linking Numbers Of Random Piecewise-Linear Embeddings Of $K_N$, Yasmin Aguillon, Xingyu Cheng, Spencer Eddins, Pedro Morales
Rose-Hulman Undergraduate Mathematics Journal
DNA and other polymer chains in confined spaces behave like closed loops. Arsuaga et al. \cite{AB} introduced the uniform random polygon model in order to better understand such loops in confined spaces using probabilistic and knot theoretical techniques, giving some classification on the mean squared linking number of such loops. Flapan and Kozai \cite{flapan2016linking} extended these techniques to find the mean sum of squared linking numbers for random linear embeddings of complete graphs $K_n$ and found it to have order $\Theta(n(n!))$. We further these ideas by inspecting random piecewise-linear embeddings of complete graphs and give introductory-level summaries of the ideas …
On 2-Primitive Triangle Decompositions Of Cocktail Party Graphs, Ian P. Waddell
On 2-Primitive Triangle Decompositions Of Cocktail Party Graphs, Ian P. Waddell
Theses, Dissertations and Capstones
A decomposition of a graph Γ is a collection C of subgraphs, perhaps nonisomorphic, that partition the edges of Γ. Analogously, consider a group of truck drivers whose non-overlapping routes jointly cover all of the roads between a set of cities; that is, each road is traversed by precisely one driver. In this scenario, the cities are the vertices of the graph, the roads are the edges between vertices, and the drivers’ routes are the subgraphs in the decomposition. Given a graph H, we call C an H-decomposition of Γ if each subgraph in C is isomorphic to …