• Login
    View Item 
    •   Home
    • LECTURER SCIENTIFIC PUBLICATION (Publikasi Ilmiah)
    • LSP-Jurnal Ilmiah Dosen
    • View Item
    •   Home
    • LECTURER SCIENTIFIC PUBLICATION (Publikasi Ilmiah)
    • LSP-Jurnal Ilmiah Dosen
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    All unicyclic Ramsey (mK2, P4)-minimal graphs

    Thumbnail
    View/Open
    FMIPA_All unicyclic Ramsey (mK2, P4)-minimal graphs.pdf (1.697Mb)
    Date
    2022-02-01
    Author
    BASKORO, Edy Tri
    WIJAYA, Kristiana
    RYAN, Joe
    Metadata
    Show full item record
    Abstract
    For graphs F, G and H, we write F → (G, H) to mean that if the edges of F are colored with two colors, say red and blue, then the red subgraph contains a copy of G or the blue subgraph contains a copy of H. The graph F is called a Ramsey (G, H) graph if F → (G, H). Furthermore, the graph F is called a Ramsey (G, H)-minimal graph if F → (G, H) but F − e 6→ (G, H) for any edge e ∈ E(F). In this paper, we characterize all unicyclic Ramsey (G, H)-minimal graphs when G is a matching mK2 for any integer m ≥ 2 and H is a path on four vertices.
    URI
    https://repository.unej.ac.id/xmlui/handle/123456789/112304
    Collections
    • LSP-Jurnal Ilmiah Dosen [7410]

    UPA-TIK Copyright © 2024  Library University of Jember
    Contact Us | Send Feedback

    Indonesia DSpace Group :

    University of Jember Repository
    IPB University Scientific Repository
    UIN Syarif Hidayatullah Institutional Repository
     

     

    Browse

    All of RepositoryCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

    My Account

    LoginRegister

    UPA-TIK Copyright © 2024  Library University of Jember
    Contact Us | Send Feedback

    Indonesia DSpace Group :

    University of Jember Repository
    IPB University Scientific Repository
    UIN Syarif Hidayatullah Institutional Repository