EUVIMEDEUVIMED entdecken
Crossref

On the Ramsey number of 4-cycle versus wheel

Enik Noviani, Edy Tri Baskoro

Indonesian Journal of Combinatorics · 2016

DOI: 10.19184/ijc.2016.1.1.2 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Indonesian Journal of Combinatorics, 2016. Verfasst von Enik Noviani und 1 weiteren Autor:innen. Die Arbeit wurde bisher 2-mal zitiert (Crossref).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

For any fixed graphs $G$ and $H$, the Ramsey number $R(G,H)$ is the smallest positive integer $n$ such that for every graph $F$ on $n$ vertices must contain $G$ or the complement of $F$ contains $H$. The girth of graph $G$ is a length of the shortest cycle. A $k$-regular graph with the girth $g$ is called a $(k,g)$-graph. If the number of of vertices in $(k,g)$-graph is minimized then we call this graph a $(k,g)$-cage. In this paper, we derive the bounds of Ramsey number $R(C_4,W_n)$ for some values of $n$. By modifying $(k, 5)$-graphs, for $k = 7$ or $9$, we construct these corresponding $(C_4,W_n)$-good graphs.

Zitieren

APA

Noviani, E., & Baskoro, E. T. (2016). On the Ramsey number of 4-cycle versus wheel. Indonesian Journal of Combinatorics. https://doi.org/10.19184/ijc.2016.1.1.2

Vancouver

Noviani E, Baskoro ET. On the Ramsey number of 4-cycle versus wheel. Indonesian Journal of Combinatorics. 2016. doi:10.19184/ijc.2016.1.1.2

BibTeX
@article{Noviani2016,
  author = {Noviani, Enik and Baskoro, Edy Tri},
  title = {On the Ramsey number of 4-cycle versus wheel},
  journal = {Indonesian Journal of Combinatorics},
  year = {2016},
  doi = {10.19184/ijc.2016.1.1.2}
}
Kostenlos starten →