•  
  •  
 

Abstract

For any edge xy in a directed graph, the subtractive edge-weight is the sum of the label of xy and the label of y minus the label of x. Similarly, for any vertex z in a directed graph, the subtractive vertex-weight of z is the sum of the label of z and all edges directed into z and all the labels of edges that are directed away from z. A subtractive magic graph has every subtractive edge and vertex weight equal to some constant k. In this paper, we will discuss variations of subtractive magic labelings on directed graphs.

Author Bio

Aaron Davis will graduate from Murray State University in 2021 with a degree in mathematics and computer science. He also enjoys playing ultimate frisbee and soccer.

Matthew Ko will graduate from Centre College in 2020 with a degree in mathematics. In addition to mathematics, he enjoys tennis, photography, and digital design.

Jason Pinto graduated from Centre College in 2019 with a degree in mathematics. He also enjoys computer science, golf, playing the violin, and playing League of Legends.

Share

COinS