On Ramsey (mK2, H)-Minimal Graphs

Please use this identifier to cite or link to this item: https://repository.unej.ac.id/xmlui/handle/123456789/112313

Title:	On Ramsey (mK2, H)-Minimal Graphs
Authors:	WIJAYA, Kristiana BASKORO, Edy Tri ASSIYATUN, Hilda SUPRIJANTO, Djoko
Keywords:	Ramsey minimal graph Edge coloring Matching Path Subdivision
Issue Date:	2-Jan-2017
Publisher:	Graphs and Combinatorics
Abstract:	Let R(G, H) denote the set of all graphs F satisfying F → (G, H) and for every e ∈ E(F), (F − e) (G, H). In this paper, we derive the necessary and sufficient conditions for graphs belonging to R(mK2, H) for any graph H and each positive integer m. We give all disconnected graphs in R(mK2, H), for any connected graph H. Furthermore, we prove that if F ∈ R(mK2, P3), then any graph obtained by subdividing one non-pendant edge in F will be in R((m + 1)K2, P3)
URI:	https://repository.unej.ac.id/xmlui/handle/123456789/112313
Appears in Collections:	LSP-Jurnal Ilmiah Dosen

Files in This Item:

File	Description	Size	Format
FMIPA_On Ramsey (mK2, H)-Minimal Graphs.pdf		466.73 kB	Adobe PDF	View/Open

DSpace JSPUI