Subdivision of Graphs in R(mK2,P4)
dc.contributor.author | WIJAYA, Kristiana | |
dc.contributor.author | BASKORO, Edy Tri | |
dc.contributor.author | ASSIYATUN, Hilda | |
dc.contributor.author | SUPRIJANTO, Djoko | |
dc.date.accessioned | 2023-02-22T07:49:20Z | |
dc.date.available | 2023-02-22T07:49:20Z | |
dc.date.issued | 2020-04-20 | |
dc.identifier.uri | https://repository.unej.ac.id/xmlui/handle/123456789/112326 | |
dc.description.abstract | For any graphs 𝐹 ,𝐺, and 𝐻, the notation 𝐹 → (𝐺,𝐻) means that any red-blue coloring of all edges of 𝐹 will contain either a red copy of 𝐺 or a blue copy of 𝐻. The set (𝐺,𝐻) consists of all Ramsey (𝐺,𝐻)-minimal graphs, namely all graphs 𝐹 satisfying 𝐹 → (𝐺,𝐻) but for each 𝑒 ∈ 𝐸(𝐹), (𝐹 − 𝑒) ↛ (𝐺,𝐻). In this paper, we propose a simple construction for creating new Ramsey minimal graphs from the previous known Ramsey minimal graphs (by subdivision operation). In particular, suppose 𝐹 ∈ (𝑚𝐾2,𝑃4) and let 𝑒 ∈ 𝐸(𝐹) be an edge contained in a cycle of 𝐹, we construct a new Ramsey minimal graph in ((𝑚 + 1)𝐾2,𝑃4) from graph 𝐹 by subdividing the edge 𝑒 four times. | en_US |
dc.language.iso | en | en_US |
dc.publisher | Heliyon | en_US |
dc.subject | Mathematics | en_US |
dc.subject | Ramsey minimal graphs | en_US |
dc.subject | Red-blue coloring | en_US |
dc.subject | Matching | en_US |
dc.subject | Path | en_US |
dc.title | Subdivision of Graphs in R(mK2,P4) | en_US |
dc.type | Article | en_US |
Files in this item
This item appears in the following Collection(s)
-
LSP-Jurnal Ilmiah Dosen [7292]
Koleksi Jurnal Ilmiah Dosen