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:
| 主要作者: | |
|---|---|
| 格式: | Final Project |
| 語言: | Indonesia |
| 在線閱讀: | 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. |
|---|