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

    Search

    Show Advanced FiltersHide Advanced Filters

    Filters

    Use filters to refine the search results.

    Now showing items 1-10 of 27

    • Sort Options:
    • Relevance
    • Title Asc
    • Title Desc
    • Issue Date Asc
    • Issue Date Desc
    • Results Per Page:
    • 5
    • 10
    • 20
    • 40
    • 60
    • 80
    • 100
    Thumbnail

    P2 ▷ H-super antimagic total labeling of comb product of graphs 

    Agustin, Ika Hesti; Prihandini, Rafiantika Megahnia; Dafik, Dafik (2018-04-12)
    Let L and H be two simple, nontrivial and undirected graphs. Let o be a vertex of H, the comb product between L and H, denoted by L ▷ H, is a graph obtained by taking one copy of L and |V(L)| copies of H and grafting the ...
    Thumbnail

    Local Edge Antimagic Coloring of Comb Product of Graphs 

    Agustin, Ika Hesti; Hasan, Mohammad; Dafik, Dafik; Alfarisi, Ridho; Kristiana, Arika Indah; Prihandini, Rafiantika Megahnia (2018-07-03)
    All graph in this paper are ¯nite, simple and connected graph. Let G(V; E) be a graph of vertex set V and edge set E. A bijection f : V (G) ¡! f1; 2; 3; :::; jV (G)jg is called a local edge antimagic labeling if for any ...
    Thumbnail

    A study of local domination number of Sn H graph 

    Dafik, Dafik; Agustin, Ika Hesti; Wardani, Dwi Agustin Retno; Kurniawati, Elsa Yuli (2018-02-28)
    All graphs in this paper are undirected, connected and simple graph. Let G = (V,E) be a graph of order |V| and size |E|. We define a set D as a dominating set if for every vertex μ epsilon V – D is adjacent to some vertex ...
    Thumbnail

    Super (a*, d*)-H-antimagic total covering of second order of shackle graphs 

    Agustin, Ika Hesti; Dafik, Dafik; Nisviasari, Rosanita; Prihandini, Rafiantika Megahnia (2018-02-28)
    Let H be a simple and connected graph. A shackle of graph H, denoted by G = shack(H; v; n), is a graph G constructed by non-trivial graphs H such that, for every 1 · s; t · n, H have no a common vertex with js ¡ tj ¸ ...
    Thumbnail

    A Super (A,D)-Bm-Antimagic Total Covering Of Ageneralized Amalgamation Of Fan Graphs 

    Agustin, Ika Hesti; Dafik, Dafik; Latifah, Siti; Prihandini, Rafiantika Megahnia (2018-02-28)
    We assume finite, simple and undirected graphs in this study. Let G, H be two graphs. By an (a,d)-H- antimagic total graph, we mean any obtained bijective function 𝑓 ∶ 𝑉 ( 𝐺 ) ∪ 𝐸 ( 𝐺 ) → {1, 2, 3, … ...
    Thumbnail

    LOCAL EDGE ANTIMAGIC COLORING OF GRAPHS 

    Agustin, Ika Hesti; Hasan, Mohammad; Dafik, Dafik; Alfarisi, Ridho; Prihandini, Rafiantika Megahnia (2018-02-28)
    All graphs considered in this paper are finite, simple and connected graphs. Let G(V, E) be a graph with the vertex set V and the edge set E, and let w be the edge weight of graph G. Then a bijection f: V (G) → {1, 2, 3, ...
    Thumbnail

    Super local edge antimagic total coloring of Pn . H 

    Kurniawati, Elsa Yuli; Agustin, Ika Hesti; Dafik, Dafik; Alfarisi, Ridho (2018-07-04)
    In this paper, we consider that all graphs are ¯nite, simple and connected. Let G(V; E) be a graph of vertex set V and edge set E. A bijection f : V (G) ¡! f1; 2; 3; :::; jV (G)jg is called a local edge antimagic labeling ...
    Thumbnail

    On the locating domination number of corona product 

    Santi, Risan Nur; Agustin, Ika Hesti; Dafik, Dafik; Alfarisi, Ridho (2018-07-04)
    Let G =(V (G),E(G) be a connected graph and v V (G). A dominating set for a graph G =(V, E) is a subset D of V such that every vertex not in D is adjacent to at least one member of D. The domination number γ(G) is the ...
    Thumbnail

    On The Local Metric Dimension of Line Graph of Special Graph 

    Marsidi, Marsidi; Dafik, Dafik; Agustin, Ika Hesti; Alfarisi, Ridho (2018-02-28)
    Let G be a simple, nontrivial, and connected graph. 𝑊 = {𝑤 } is a representation of an ordered set of k distinct vertices in a nontrivial connected graph G. The metric code of a vertex v, where 𝑣 ∈ G, the ordered ...
    Thumbnail

    The Construction of P2⊳H- antimagic graph using smaller edge - antimagic vertex labeling 

    Prihandini, Rafiantika Megahnia; Agustin, Ika Hesti; Dafik, Dafik (2018-07-04)
    In this paper we use simple and non trivial graph. If there exist a bijective function g : V (G) [ E(G) ! f1; 2; : : : ; jV (G)j + jE(G)jg, such that for all subgraphs P 2 B H of G isomorphic to H, then graph G is ...
    • 1
    • 2
    • 3

    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

    Discover

    Author
    Dafik, Dafik (27)
    Agustin, Ika Hesti (26)Alfarisi, Ridho (12)Prihandini, Rafiantika Megahnia (7)Kristiana, Arika Indah (4)Kurniawati, Elsa Yuli (4)Slamin, Slamin (4)Marsidi, Marsidi (3)Wardani, Dwi Agustin Retno (3)Albirri, Ermita Rizki (2)... View MoreSubjectdomination number (2)r-dynamic chromatic number (2)-corona product (1)05C15 (1)amalgamation graphs (1)amalgamation of any graph (1)Antimagic labeling (1)antimagic labeling (1)antimagic total labeling (1)antimagic vertex labeling (1)... View MoreDate Issued2018 (20)2019 (6)2017 (1)Has File(s)Yes (27)

    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