Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 3 of 3
Full-Text Articles in Physical Sciences and Mathematics
Vertex-Magic Total Labeling On G-Sun Graphs, Melissa Mejia
Vertex-Magic Total Labeling On G-Sun Graphs, Melissa Mejia
Honors Program Theses and Projects
Graph labeling is an immense area of research in mathematics, specifically graph theory. There are many types of graph labelings such as harmonious, magic, and lucky labelings. This paper will focus on magic labelings. Graph theorists are particularly interested in magic labelings because of a simple problem regarding tree graphs introduced in the 1990’s. The problem is still unsolved after almost thirty years. Researchers have studied magic labelings on other graphs in addition to tree graphs. In this paper we will consider vertex-magic labelings on G-sun graphs. We will give vertex-magic total labelings for ladder sun graphs and complete bipartite …
Modified Ramsey Numbers, Meaghan Mahoney
Modified Ramsey Numbers, Meaghan Mahoney
Honors Program Theses and Projects
Ramsey theory is a eld of study named after the mathematician Frank P. Ramsey. In general, problems in Ramsey theory look for structure amid a collection of unstructured objects and are often solved using techniques of Graph Theory. For a typical question in Ramsey theory, we use two colors, say red and blue, to color the edges of a complete graph, and then look for either a complete subgraph of order n whose edges are all red or a complete subgraph of order m whose edges are all blue. The minimum number of vertices needed to guarantee one of these …
Firefighter Problem Played On Infinite Graphs, Sarah Days-Merrill
Firefighter Problem Played On Infinite Graphs, Sarah Days-Merrill
Honors Program Theses and Projects
The Firefighter Problem was introduced over 30 years ago and continues to be studied by researchers today. The problem consists of a graph of interest where a fire breaks out at time t = 0 on any given vertex of thegraph G. The player, then, gets to place a firefighter to “protect” a vertex from the fire. Each consecutive turn,the fire spreads to adjacent vertices. These vertices are then referred to as “burned”. The firefighter also gets tomove to protect an additional, unburned vertex, completing the first round. Each vertex that the firefighter “defends” stays protected for the remainder …