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 |