DSpace JSPUI
DSpace preserves and enables easy and open access to all types of digital content including text, images, moving images, mpegs and data sets
Learn More
Please use this identifier to cite or link to this item:
https://repository.unej.ac.id/xmlui/handle/123456789/112319| Title: | On Ramsey (3K2,K3)−minimal graphs |
| Authors: | WIJAYA, Kristiana BASKORO, Edy Tri ASSIYATUN, Hilda SUPRIJANTO, Djoko |
| Keywords: | Ramsey minimal graph edge coloring matching complete graph |
| Issue Date: | 24-Feb-2016 |
| Publisher: | AIP Conference Proceedings |
| Abstract: | The Ramsey graph theory has many interesting applications, such as in the fields of communications, information retrieval, and decision making. One of growing topics in Ramsey theory is Ramsey minimal graph. For any given graphs G and H, find graphs F such that any red-blue coloring of all edges of F contains either a red copy of G or a blue copy of H. If this condition is not satisfied by the graph F −e, then we call the graph F as a Ramsey (G,H)−minimal. In this paper, we derive the properties of (3K2,K3)−minimal graphs. We, then, characterize all Ramsey (3K2,K3)−minimal graphs |
| URI: | https://repository.unej.ac.id/xmlui/handle/123456789/112319 |
| Appears in Collections: | LSP-Conference Proceeding |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| FMIPA_On Ramsey (3K2,K3)−minimal graphs.pdf | 809.9 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.