Mathematics Honors Theseshttp://hdl.handle.net/20.500.13013/21532023-02-02T22:54:41Z2023-02-02T22:54:41ZPebbling And Cover Pebbling Numbers Of GraphsBarbosa, Ellehttp://hdl.handle.net/20.500.13013/26222022-09-29T16:25:36Z2022-05-01T00:00:00ZPebbling And Cover Pebbling Numbers Of Graphs
Barbosa, Elle
Cover pebbling is a method in graph theory that was first brought about by Largias and Saks. This topic in graph theory was used to come up with a way to calculate how much of a consumable resource would being needed to begin transportation of said consumable resource. This paper will tackle the basics on cover pebbling, brush upon weight pebbling, and problem 9 of the open problems that can be found in Betsy Crull's paper The cover pebbling number of graphs. Problem 9: What are the cover pebbling number for other graphs G, for example cubes, complete r-partite graphs, etc.
2022-05-01T00:00:00ZConfidence Levels of SSU Education Students in Writing AssessmentsEkstrom, Alyssahttp://hdl.handle.net/20.500.13013/8042022-09-29T16:25:32Z2021-05-01T00:00:00ZConfidence Levels of SSU Education Students in Writing Assessments
Ekstrom, Alyssa
Salem State University has a newly accredited 4+1 masterâ€™s in education program but has been teaching education for decades. Given the newness of the 4+1 program, are the students getting a good idea of what assessments to write, what they look like, and when to do which type of assessment? This study investigates the confidence levels of SSU Education students in writing assessments based on their experiences and classes that they have taken in the School of Education. In order to examine this question, a survey was completed by students in the education program in which they specified their knowledge on each type of assessment (summative and formative), which classes they have taken, what experiences they have had, and how comfortable they are writing both. It is then analyzed by the classes they have taken the program, their comfortability, and knowledge of each assessment.
2021-05-01T00:00:00ZExploring The Thirteen Colorful Variations Of Guthrie's Four-Color ConjectureKeough, Kathrynhttp://hdl.handle.net/20.500.13013/7662022-09-29T16:25:30Z2020-05-01T00:00:00ZExploring The Thirteen Colorful Variations Of Guthrie's Four-Color Conjecture
Keough, Kathryn
Coloring is an important part of graph theory. Historically, it was thought that only four colors could be the minimal number of colors. This paper discusses the Four Color Theorem and how the Four Color Theorem is applied to graphs. This paper gives an overview of several different definitions involved with graphs and shows how to create a dual graph. This paper also discusses how a graph of 12 regions has at least one region bounded by less than five edges. The paper includes several figures which include graphs, dual graphs, and different colorings. The paper also provides a proof which shows mathematically why a graph of 12 regions has at least one region bounded by less than five edges.
2020-05-01T00:00:00ZRanking College Football Teams Independent of Victory MarginsKelly, Ryanhttp://hdl.handle.net/20.500.13013/7292022-09-29T16:25:28Z2014-05-17T00:00:00ZRanking College Football Teams Independent of Victory Margins
Kelly, Ryan
This paper addresses David Mease's formula for ranking college football teams. It is just one of the numerous formulas that can be used by the Bowl Championship Series in ranking the top teams in the country. Mease uses his formula to rank teams independent of victory margins, something not all formulas take into consideration, Winning margin may help teams gain higher ranking in some formulas, so this formula ignores that statistic.
2014-05-17T00:00:00Z