Title

The sum numbers of disjoint families of graphs

Date of Publication

2018

Document Type

Bachelor's Thesis

Degree Name

Bachelor of Science in Mathematics with specialization in Business Applications

Subject Categories

Mathematics

College

College of Science

Department/Unit

Mathematics and Statistics Department

Abstract/Summary

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 [4]. 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.

Abstract Format

html

Language

English

Format

Electronic

Accession Number

CDTU017649

Shelf Location

Archives, The Learning Commons, 12F, Henry Sy Sr. Hall

This document is currently not available here.

Share

COinS