Melola Discovery

← Melola Discovery

Jurnal SINTA 1

Restricted Size Ramsey Number Involving Matching and Graph of Order Five

Journal of Mathematical and Fundamental Sciences · Vol. 52 No. 2 (2020) · hlm. 133–142

DOI
10.5614/j.math.fund.sci.2020.52.2.1
ISSN
2338-5510, 2337-5760
Terbit
2020-09-01
Penerbit
Directorate for Research and Innovation (DRI) ITB
Bahasa
eng

Abstrak

Harary and Miller (1983) started the research on the (restricted) size Ramsey number for a pair of small graphs. They obtained the values for some pairs of small graphs with order not more than four. In the same year, Faudree and Sheehan continued the research and extended the result to all pairs of small graphs with order not more than four. Moreover, in 1998, Lortz and Mengenser gave the size Ramsey number and the restricted size Ramsey number for all pairs of small forests with order not more than five. Recently, we gave the restricted size Ramsey number for a path of order three and any connected graph of order five. In this paper, we continue the research on the (restricted) size Ramsey number involving small graphs by investigating the restricted size Ramsey number for matching with two edges versus any graph of order five with no isolates.

Kata kunci

Jaringan kolaborasi para penulis

22 penulis · 39 tautan kepenulisan bersama · 10 lintas organisasi

Arahkan kursor atau ketuk sebuah nama untuk menyorot rekan penulisnya. Klik dua kali untuk membuka halaman penulis.

  • Bandung Institute of Technology
  • University of Indonesia
  • Universitas Muhammadiyah Malang
  • Hasanuddin University
  • Indonesia University of Education
  • Politeknik Negeri Bandung
  • Afiliasi tidak diketahui
  • Organisasi berbeda
  • Organisasi sama
  • Afiliasi tidak diketahui
  • Garis lebih tebal = lebih banyak artikel bersama · lingkaran lebih besar = lebih banyak artikel
Tampilkan sebagai tabel
Rekan penulisOrganisasiArtikel bersama
Hilda AssiyatunBandung Institute of Technology2
Miming Fikria CamillaUniversity of Indonesia1
Melza RensianaUniversity of Indonesia1
Shariefuddin; University of Kashmir PirzadaAfiliasi tidak diketahui1
Hilal A; University of Kashmir GanieAfiliasi tidak diketahui1
Asmiati AsmiatiBandung Institute of Technology1
A.N.M. SalmanBandung Institute of Technology1
Hajo J. BroersmaBandung Institute of Technology1
Yus Mochamad CholilyUniversitas Muhammadiyah Malang1
Nurdin NurdinHasanuddin University1
Muhammad Kamran SiddiquiAfiliasi tidak diketahui1
Novriana SumartiBandung Institute of Technology1
Khusnul NovianingsihIndonesia University of Education1
Kuntjoro A. SidartoAfiliasi tidak diketahui1
Edy SoewonoBandung Institute of Technology1
Rieske HadiantiBandung Institute of Technology1
Dian Kastika SyofyanBandung Institute of Technology1
Anie LusianiPoliteknik Negeri Bandung1
Suhadi Wido SaputroBandung Institute of Technology1

Afiliasi berasal dari OpenAlex; metadata OAI-PMH jurnal tidak memuatnya. Penulis tanpa ID OpenAlex dicocokkan berdasarkan nama, sehingga dua orang bisa tergabung atau satu orang bisa terpisah.

Sumber metadata: OAI-PMH (metadata jurnal) https://journals.itb.ac.id/index.php/jmfs/oai, pertama di-harvest 9 Nov 2026, terakhir terlihat 16 Nov 2026.
Metadata asli (oai_dc)
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/  http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">Restricted Size Ramsey Number Involving  Matching and Graph of Order Five</dc:title>
	<dc:creator>Silaban, Denny Riama</dc:creator>
	<dc:creator>Baskoro, Edy Tri</dc:creator>
	<dc:creator>Uttunggadewa, Saladin</dc:creator>
	<dc:subject xml:lang="en-US">restricted size Ramsey number</dc:subject>
	<dc:subject xml:lang="en-US">matching</dc:subject>
	<dc:subject xml:lang="en-US">graph with no isolates</dc:subject>
	<dc:description xml:lang="en-US">Harary and Miller (1983) started the research on the (restricted) size Ramsey number for a pair of small graphs. They obtained the values for some pairs of small graphs with order not more than four. In the same year, Faudree and Sheehan continued the research and extended the result to all pairs of small graphs with order not more than four. Moreover, in 1998, Lortz and Mengenser gave the size Ramsey number and the restricted size Ramsey number for all pairs of small forests with order not more than five. Recently, we gave the restricted size Ramsey number for a path of order three and any connected graph of order five. In this paper, we continue the research on the (restricted) size Ramsey number involving small graphs by investigating the restricted size Ramsey number for matching with two edges versus any graph of order five with no isolates.</dc:description>
	<dc:publisher xml:lang="en-US">Directorate for Research and Innovation (DRI) ITB</dc:publisher>
	<dc:date>2020-09-01</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://journals.itb.ac.id/index.php/jmfs/article/view/7058</dc:identifier>
	<dc:identifier>10.5614/j.math.fund.sci.2020.52.2.1</dc:identifier>
	<dc:source xml:lang="en-US">Journal of Mathematical and Fundamental Sciences; Vol. 52 No. 2 (2020); 133-142</dc:source>
	<dc:source>2338-5510</dc:source>
	<dc:source>2337-5760</dc:source>
	<dc:source>10.5614/j.math.fund.sci.2019.52.2</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://journals.itb.ac.id/index.php/jmfs/article/view/7058/4639</dc:relation>
</oai_dc:dc>