The sum numbers of disjoint families of graphs
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 require...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | text |
| Language: | English |
| Published: |
Animo Repository
2018
|
| Subjects: | |
| Online Access: | https://animorepository.dlsu.edu.ph/etd_bachelors/18562 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | De La Salle University |
| Language: | English |
| id |
oai:animorepository.dlsu.edu.ph:etd_bachelors-19075 |
|---|---|
| record_format |
eprints |
| spelling |
oai:animorepository.dlsu.edu.ph:etd_bachelors-190752022-02-11T05:27:48Z The sum numbers of disjoint families of graphs Eder, Ermar Edhric H. Quindoza, Veronica Jane M. Tan, Michele G. 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. 2018-01-01T08:00:00Z text https://animorepository.dlsu.edu.ph/etd_bachelors/18562 Bachelor's Theses English Animo Repository Mathematics |
| institution |
De La Salle University |
| building |
De La Salle University Library |
| continent |
Asia |
| country |
Philippines Philippines |
| content_provider |
De La Salle University Library |
| collection |
DLSU Institutional Repository |
| language |
English |
| topic |
Mathematics |
| spellingShingle |
Mathematics Eder, Ermar Edhric H. Quindoza, Veronica Jane M. Tan, Michele G. The sum numbers of disjoint families of graphs |
| description |
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. |
| format |
text |
| author |
Eder, Ermar Edhric H. Quindoza, Veronica Jane M. Tan, Michele G. |
| author_facet |
Eder, Ermar Edhric H. Quindoza, Veronica Jane M. Tan, Michele G. |
| author_sort |
Eder, Ermar Edhric H. |
| title |
The sum numbers of disjoint families of graphs |
| title_short |
The sum numbers of disjoint families of graphs |
| title_full |
The sum numbers of disjoint families of graphs |
| title_fullStr |
The sum numbers of disjoint families of graphs |
| title_full_unstemmed |
The sum numbers of disjoint families of graphs |
| title_sort |
sum numbers of disjoint families of graphs |
| publisher |
Animo Repository |
| publishDate |
2018 |
| url |
https://animorepository.dlsu.edu.ph/etd_bachelors/18562 |
| _version_ |
1772835175073316864 |