The sum numbers of disjoint families of graphs
Date of Publication
Bachelor of Science in Mathematics with specialization in Business Applications
College of Science
Mathematics and Statistics Department
A graph G is said to be a sum graph if there exist a labeling of G using positive integers such that two vertices labeled a and b in G are adjacent if and only if another vertex in G has a label a+b . The said labeling then is called a sum labeling. The minimum number of isolated vertices required such that G is a sum graph is called the sum number of G. This study was motivated by Miller's et. al. article entitled The Sum number of a Disjoint Union of Graphs. Theorems about the sum number of disjoint union of graphs were presented. In this study, we presented theorems on the sum number of disjoint union of special types of graphs.
Archives, The Learning Commons, 12F, Henry Sy Sr. Hall
Eder, E. H., Quindoza, V. M., & Tan, M. G. (2018). The sum numbers of disjoint families of graphs. Retrieved from https://animorepository.dlsu.edu.ph/etd_bachelors/18562