Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 3 of 3
Full-Text Articles in Applied Mathematics
Elliptic Curves And Cryptography, Linh Nguyen, Andrew Shallue, Faculty Advisor
Elliptic Curves And Cryptography, Linh Nguyen, Andrew Shallue, Faculty Advisor
John Wesley Powell Student Research Conference
No abstract provided.
In Pursuit Of The Ringel-Kotzig Conjecture: Uniform K-Distant Trees Are Graceful, Kimberly Wenger, Daniel Roberts, Faculty Advisor
In Pursuit Of The Ringel-Kotzig Conjecture: Uniform K-Distant Trees Are Graceful, Kimberly Wenger, Daniel Roberts, Faculty Advisor
John Wesley Powell Student Research Conference
Graph labeling has been an active area of research since 1967, when Rosa introduced the concept. Arguably, the biggest open conjecture in the field is referred to as the Ringel-Kotzig conjecture, which states that all trees admit a graceful labeling. In this talk, we will give a bit of background on the problem, as well as present our own results. Namely, that a certain infinite class of trees (called uniform k-distant trees) admits a graceful labeling.
Decomposing Complete Graphs Into A Graph Pair Of Order 6, Yizhe Gao, Daniel Roberts, Faculty Advisor
Decomposing Complete Graphs Into A Graph Pair Of Order 6, Yizhe Gao, Daniel Roberts, Faculty Advisor
John Wesley Powell Student Research Conference
Firstly, a graph G consists of a vertex set V (G), and an edge set E (G) of endpoints which relate two vertices with each edge. Also, a decomposition of a graph is a list of subgraphs such that each edge appears in exactly one subgraph in the list. In the field of graph theory, graph decomposition is an active field of research. A graph pair is a pair of graphs on the same vertex set whose union is the complete graph. Abueida and Daven studied decompositions of complete graphs into graph-pairs of order four and five. We are extending …