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...
محفوظ في:
المؤلفون الرئيسيون: | , , |
---|---|
التنسيق: | text |
اللغة: | English |
منشور في: |
Animo Repository
2018
|
الموضوعات: | |
الوصول للمادة أونلاين: | https://animorepository.dlsu.edu.ph/etd_bachelors/18562 |
الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
المؤسسة: | De La Salle University |
اللغة: | English |
الملخص: | 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. |
---|