On the ramsey numbers for the tree graphs versus certain generalised wheel graphs
Given two simple graphs G and H, the Ramsey number R(G, H) is the smallest integer n such that for any graph of order n, either it contains G or its complement contains H. Let T-n be a tree graph of order n and W-s,W-m be the generalised wheel graph K-s + C-m. In this paper, we show that for n >=...
Saved in:
Main Authors: | Chng, Zhi Yee, Tan, Ta Sheng, Wong, Kok Bin |
---|---|
Format: | Article |
Published: |
Elsevier
2021
|
Subjects: | |
Online Access: | http://eprints.um.edu.my/27184/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
On the Burning Number of Generalized Petersen Graphs
by: Sim, Kai An, et al.
Published: (2018) -
Lazy cops and robber on certain cayley graph
by: Sim, Kai An, et al.
Published: (2022) -
Crossing Numbers of Certain Graphs
by: Yiew, Yip Chong
Published: (2004) -
Radio and radial radio numbers of certain sunflower extended graphs
by: Kaabar, Mohammed K. A., et al.
Published: (2022) -
A note on on-line Ramsey numbers of stars and paths
by: Mohd Latip, Fatin Nur Nadia Binti, et al.
Published: (2021)