RAMSEY NUMBER FOR PAIR OF STAR GRAPH WITH DUMBBELL GRAPH
The star graph K1,p?1 is a connected graph that has one vertex of degree p?1 and all other vertices of degree 1. The dumbbell graph Dn,m is the complete graph Kn and Km that are mutually exclusive with exactly a pair of adjacent vertices (vp,vm), vp ? Kp,vm ? Km. Let G,G1,G2 be simple graphs. The...
Saved in:
| Main Author: | |
|---|---|
| Format: | Final Project |
| Language: | Indonesia |
| Online Access: | https://digilib.itb.ac.id/gdl/view/73200 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |
| id |
id-itb.:73200 |
|---|---|
| spelling |
id-itb.:732002023-06-16T10:47:16ZRAMSEY NUMBER FOR PAIR OF STAR GRAPH WITH DUMBBELL GRAPH Bimo Rizqullah, Sulthan Indonesia Final Project Ramsey Number, star graph, dumbell graph INSTITUT TEKNOLOGI BANDUNG https://digilib.itb.ac.id/gdl/view/73200 The star graph K1,p?1 is a connected graph that has one vertex of degree p?1 and all other vertices of degree 1. The dumbbell graph Dn,m is the complete graph Kn and Km that are mutually exclusive with exactly a pair of adjacent vertices (vp,vm), vp ? Kp,vm ? Km. Let G,G1,G2 be simple graphs. The Ramsey number R(G1,G2) denotes the smallest integer n such that for every simple graph G with n vertices, either G1 ? G or G2 ? G. In this final project, we determine the values of the Ramsey number for pairs of star graphs with barbell graphs, R(K1,p?1,Dn,m), for every p ? 2, 3 ? n ? m, where p,n,m are natural numbers. text |
| institution |
Institut Teknologi Bandung |
| building |
Institut Teknologi Bandung Library |
| continent |
Asia |
| country |
Indonesia Indonesia |
| content_provider |
Institut Teknologi Bandung |
| collection |
Digital ITB |
| language |
Indonesia |
| description |
The star graph K1,p?1 is a connected graph that has one vertex of degree p?1 and
all other vertices of degree 1. The dumbbell graph Dn,m is the complete graph Kn
and Km that are mutually exclusive with exactly a pair of adjacent vertices (vp,vm),
vp ? Kp,vm ? Km. Let G,G1,G2 be simple graphs. The Ramsey number R(G1,G2)
denotes the smallest integer n such that for every simple graph G with n vertices, either
G1 ? G or G2 ? G. In this final project, we determine the values of the Ramsey
number for pairs of star graphs with barbell graphs, R(K1,p?1,Dn,m), for every p ? 2,
3 ? n ? m, where p,n,m are natural numbers. |
| format |
Final Project |
| author |
Bimo Rizqullah, Sulthan |
| spellingShingle |
Bimo Rizqullah, Sulthan RAMSEY NUMBER FOR PAIR OF STAR GRAPH WITH DUMBBELL GRAPH |
| author_facet |
Bimo Rizqullah, Sulthan |
| author_sort |
Bimo Rizqullah, Sulthan |
| title |
RAMSEY NUMBER FOR PAIR OF STAR GRAPH WITH DUMBBELL GRAPH |
| title_short |
RAMSEY NUMBER FOR PAIR OF STAR GRAPH WITH DUMBBELL GRAPH |
| title_full |
RAMSEY NUMBER FOR PAIR OF STAR GRAPH WITH DUMBBELL GRAPH |
| title_fullStr |
RAMSEY NUMBER FOR PAIR OF STAR GRAPH WITH DUMBBELL GRAPH |
| title_full_unstemmed |
RAMSEY NUMBER FOR PAIR OF STAR GRAPH WITH DUMBBELL GRAPH |
| title_sort |
ramsey number for pair of star graph with dumbbell graph |
| url |
https://digilib.itb.ac.id/gdl/view/73200 |
| _version_ |
1822007042944008192 |