Article Per Year (5 Year)
p-Index From 2019 - 2024
3.147
P-Index
This Author published in this journals
All Journal International Journal of Electrical and Computer Engineering CAUCHY: Jurnal Matematika Murni dan Aplikasi Prosiding Seminar Matematika dan Pendidikan Matematik UNEJ e-Proceeding Jurnal Matematika: MANTIK Indonesian Journal of Combinatorics CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS Dedication : Jurnal Pengabdian Masyarakat
Ika Hesti Agustin, Ika Hesti
Department Of Mathematics, University Of Jember, Indonesia.
Computer Science & IT Decision Sciences, Operations Research & Management Education Electrical & Electronics Engineering Mathematics Other

Published : 45 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 45 Documents
Search

 1   2   3   4   5 
Super (a,d)-H-Antimagic Total Covering pada Graf Semi Windmill Wuni, Sherly Citra; Agustin, Ika Hesti; Dafik, Dafik
Prosiding Seminar Matematika dan Pendidikan Matematik Vol 1 No 5 (2014): Prosiding Seminar Nasional Matematika 2014
Publisher : Prosiding Seminar Matematika dan Pendidikan Matematik

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

A graph $G(V,E)$ has a $\mathcal{H}$-covering if every edge in $E$ belongs to a subgraph of $G$ isomorphic to $\mathcal{H}$. An $(a,d)$-$\mathcal{H}$-antimagic total covering is a total labeling $\lambda$ from $V(G)\cup E(G)$ onto the integers $\{1,2,3,...,|V(G)\cup E(G)|\}$ with the property that, for every subgraph $A$ of $G$ isomorphic to $\mathcal{H}$ the $\sum{A}=\sum_{v\in{V(A)}}\lambda{(v)}+\sum_{e\in{E(A)}}\lambda{(e)}$ forms an arithmetic sequence. A graph that admits such a labeling is called an $(a,d)$-$\mathcal{H}$-antimagic total covering. Inaddition, if $\{\lambda{(v)}\}_{v\in{V}}=\{1,...,|V|\}$, then thegraph is called $\mathcal{H}$-super antimagic graph. In this paperwe study of Shackle of Semi {\it Windmill}
Super ({\it a,d})-${\mathcal {H}}$-Antimagic Total Selimut pada Shackle Graf Triangular Book H.P, Putri Rizky; Agustin, Ika Hesti; Dafik, Dafik
Prosiding Seminar Matematika dan Pendidikan Matematik Vol 1 No 5 (2014): Prosiding Seminar Nasional Matematika 2014
Publisher : Prosiding Seminar Matematika dan Pendidikan Matematik

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Diberikan $G$ graf sederhana, terhubung dan tidak berarah. $G(V,E)$ memiliki selimut-$\mathcal{H}$ jika setiap sisi pada $E$ bagian dari subgraf $G$ yang isomorphic dengan $\mathcal{H}$. Total selimut $(a,d)$-$\mathcal{H}$-antimagic adalah pelabelan total $\lambda$ dari $V(G)\cup E(G)$ ke bilangan bulat $\{1,2,3,...,|V(G)\cup E(G)|\}$, untuk setiap subgraf $H$ dari $G$ yang isomorfik dengan $\mathcal{H}$ dimana $\sum{H}=\sum_{v\in{V(H)}}\lambda{(v)}+\sum_{e\in{E(H)}}\lambda{(e)}$ merupakan barisan aritmatika. Jika $\{\lambda{(v)}\}_{v\in{V}}=\{1,...,|V|\}$, maka graf disebut graf super $\mathcal{H}$- antimagic. Pada makalah ini, kita mengkaji mengenai super ({\it a,d})-$(Bt_3+2e)$- antimagic total selimut pada shackle graf triangular book dinotasikan dengan $SBt_n$.}
Bilangan Dominasi Dari Graf-Graf Khusus Wardani, Dwi Agustin Retno; Agustin, Ika Hesti; Dafik, Dafik
Prosiding Seminar Matematika dan Pendidikan Matematik Vol 1 No 5 (2014): Prosiding Seminar Nasional Matematika 2014
Publisher : Prosiding Seminar Matematika dan Pendidikan Matematik

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

$Dominating$ $number$  $\gamma (G)$ adalah kardinalitas terkecil dari sebuah $do\-mi\-na\-ting$ $set$. Nilai dari $dominating$ $number$ selalu  $\gamma (G)\subseteq V(G)$. $Dominating$ $set$ merupakan suatu konsep penentuan suatu titik pada graf dengan ketentuan titik sebagai $dominating$ $set$ mengcover titik yang ada disekitarnya dan seminimal mungkin dengan ketentuan graf sederhana yang tidak memiliki loop dan sisi ganda. Diberikan graf $G$ dengan $V$ titik dan $E$ sisi, misalkan $D$ merupakan subset dari $V$. Jika setiap titik dari $V-D$ saling $adjacent$ sedikitnya dengan satu titik dari $D$, maka $D$ dikatakan $dominating$ $set$ dalam graf $G$. Artikel ini akan membahas $dominating$ $set$ pada beberapa graf khusus diantaranya adalah Graf Bunga ($Fl_n$), Graf Gunung Berapi ($\vartheta_n$), Graf Firecracker ($F_{n,k}$), Graf Pohon Pisang ($B_{n,m}$) dan Graf tunas kelapa ($CR_{n,m}$).}
On Rainbow Vertex Antimagic Coloring of Graphs: A New Notion Marsidi, Marsidi; Agustin, Ika Hesti; Dafik, Dafik; Kurniawati, Elsa Yuli
CAUCHY Vol 7, No 1 (2021): CAUCHY: Jurnal Matematika Murni dan Aplikasi
Publisher : Mathematics Department, Maulana Malik Ibrahim State Islamic University of Malang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.18860/ca.v7i1.12796

Abstract

All graph in this paper are simple, finite, and connected. Let  be a labeling of a graph . The function  is called antimagic rainbow edge labeling if for any two vertices  and , all internal vertices in path  have different weight, where the weight of vertex is the sum of its incident edges label. The vertex weight denoted by  for every . If G has a antimagic rainbow edge labeling, then  is a antimagic rainbow vertex connection, where the every vertex is assigned with the color . The antimagic rainbow vertex connection number of , denoted by , is the minimum colors taken over all rainbow vertex connection induced by antimagic rainbow edge labeling of . In this paper, we determined the exact value of the antimagic rainbow vertex connection number of path ( ), wheel ( ), friendship ( ), and fan ( ).
Stream-keys generation based on graph labeling for strengthening Vigenere encryption Antonius Cahya Prihandoko; Dafik Dafik; Ika Hesti Agustin
International Journal of Electrical and Computer Engineering (IJECE) Vol 12, No 4: August 2022
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijece.v12i4.pp3960-3969

Abstract

This paper address the cryptographic keys management problem: how to generate the cryptographic keys and apply them to secure encryption. The purpose of this research was to study on utilizing graph labeling for generating stream-keys and implementing the keys for strengthening Vigenere encryption. To achieve this objective, the research was carried out in four stages: developing an algorithm for generating stream-keys, testing the randomness of the constructed keys, implementing the eligible keys in a modified Vigenere encryption and, finally, analyzing the security of the encryption. As the result, most of stream-keys produced by the algorithm are random, and the implementation of the stream keys to the modified Vigenere cipher achieve good security. The contributions of this research are utilizing graph labeling to generate stream-keys and providing different encryption keys for different blocks in a block based cipher with low storage capacity. The novel technical results yielded from this research are the algorithm of developing the source of the stream-keys based on graph labeling, the algorithm of constructing the initial block keys, and the protocol of a modified Vigenere encryption using stream-keys and operated in cipher block chaining mode.
The Local Antimagic On Disjoint Union of Some Family Graphs Marsidi Marsidi; Ika Hesti Agustin
Jurnal Matematika MANTIK Vol. 5 No. 2 (2019): Mathematics and Applied Mathematics
Publisher : Mathematics Department, Faculty of Science and Technology, UIN Sunan Ampel Surabaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (274.121 KB) | DOI: 10.15642/mantik.2019.5.2.69-75

Abstract

A graph in this paper is nontrivial, finite, connected, simple, and undirected. Graph consists of a vertex set and edge set. Let u,v be two elements in vertex set, and q is the cardinality of edge set in G, a bijective function from the edge set to the first q natural number is called a vertex local antimagic edge labelling if for any two adjacent vertices and , the weight of is not equal with the weight of , where the weight of (denoted by ) is the sum of labels of edges that are incident to . Furthermore, any vertex local antimagic edge labelling induces a proper vertex colouring on where is the colour on the vertex . The vertex local antimagic chromatic number is the minimum number of colours taken over all colourings induced by vertex local antimagic edge labelling of . In this paper, we discuss about the vertex local antimagic chromatic number on disjoint union of some family graphs, namely path, cycle, star, and friendship, and also determine the lower bound of vertex local antimagic chromatic number of disjoint union graphs. The chromatic numbers of disjoint union graph in this paper attend the lower bound.
On the edge r-dynamic chromatic number of some related graph operations Novian Nur Fatihah; Arika Indah Kriatiana; Ika Hesti Agustin; Dafik Dafik
UNEJ e-Proceeding 2016: Proceeding The 1st International Basic Science Conference
Publisher : UPT Penerbitan Universitas Jember

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

All graphs in this paper are simple, nontrivial, connected and undirected. By an edge proper k-coloring of a graph G, we mean a map c : E(G) ! S, where jSj = k, such that any two adjacent edges receive different colors. An edge r-dynamic k-coloring is a proper k-coloring c of G such that jc(N(uv))j min (r; d(u) + d(v) ???? 2) for each edge uv in V (G), where N(uv) is the neighborhood of uv and c(S) = c(uv) : uv2S for an edge subset S. The edge r-dynamic chromatic number, written as r(G), is the minimum k such that G has an edge r-dynamic k-coloring. In this paper, we will determine the edge coloring r-dynamic number of a comb product of some graph, denote by G D H. Comb product of some graph is a graph formed by two graphs G and H, where each edge of graph G is replaced by which one edge of graph H.
The Rainbow (1,2)-Connection Number of Exponential Graph and It’s Lower Bound Gembong A. W.; Dafik Dafik; Ika Hesti Agustin; Slamin Slamin
UNEJ e-Proceeding 2016: Proceeding The 1st International Basic Science Conference
Publisher : UPT Penerbitan Universitas Jember

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Let G = (V, E) be a simple, nontrivial, finite, connected and undirected graph. Let c be a coloring c : E(G) → {1, 2, . . . , k}, k ∈ N. A path in an edge colored graph is said to be a rainbow path if no two edges on the path have the same color. An edge colored graph G is rainbow connected if there exists a rainbow u − v path for every two vertices u and v of G. The rainbow connection number of a graph G, denoted by rc(G), is the smallest number of k colors required to edge color the graph such that the graph is rainbow connected. Furthermore, for an l-connected graph G and an integer k with 1 ≤ k ≤ l, the rainbow k-connection number rck(G) of G is defined to be the minimum number of colors required to color the edges of G such that every two distinct vertices of G are connected by at least k internally disjoint rainbow paths. In this paper, we determine the exact values of rainbow connection number of exponential graphs, namely Path of ladder as exponent, Cycle of Ladder as exponent, Cycle of Triangular Ladder as exponent, Cycle of Complete as exponent. We also proved that rc2(G) = diam(G) + 1.
Construction of Super H-Antimagicness of Graph by Uses a Partition Technique with Cancelation Number Rafiantika Megahnia Prihandini; Dafik Dafik; Ika Hesti Agustin
UNEJ e-Proceeding 2016: Proceeding The 1st International Basic Science Conference
Publisher : UPT Penerbitan Universitas Jember

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Abstract—The graph operation is one method to construct a new graph by applying the operation to two or more graph. One of graph operation is amalgamation, let {Hi} be a finite collection of nontrivial, simple and undirected graphs and let each Hi has a fixed vertex vj called a terminal. The terminal of graph operation is formed by taking all the Hi’s and identifying their terminal. When Hi are all isomorphic graphs, for any positif integer n, we denote such amalgamation by G = Amal(H, v, n), where n denotes the number of copies of H and v is the terminal. The graph G is said to be an (a, d)-H-antimagic total graph if there exist a bijective function f : V (G) ∪ E(G) → {1, 2, . . . , |V (G)| + |E(G)|} such that for all subgraphs isomorphic to H, the total H-weights W(H) = ∑v∈V (H) f(v) + ∑e∈E(H) f(e) form an arithmetic sequence {a, a + d, a + 2d, ..., a + (n − 1)d}, where a and d are positive integers and n is the number of all subgraphs isomorphic to H. An (a, d)-H-antimagic total labeling f is called super if the smallest labels appear in the vertices. In this paper, we study a super (a, d)-H antimagic total labeling of connected of graph G = Amal(H, Ps+2, n) by uses a partition technique with cancelation number. The result is graph G = Amal(H, Ps+2, n) admits a super(a, d)-H antimagic total labeling for almost feasible difference d.
Implementation of super H-antimagic total graph on establishing stream cipher Antonius Cahya Prihandoko; D. Dafik; Ika Hesti Agustin
Indonesian Journal of Combinatorics Vol 3, No 1 (2019)
Publisher : Indonesian Combinatorial Society (InaCombS)

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (308.19 KB) | DOI: 10.19184/ijc.2019.3.1.2

Abstract

This paper is aimed to study the use of super (a, d)-H antimagic total graph on generating encryption keys that can be used to establish a stream cipher. Methodology to achieve this goal was undertaken in three steps. First of all the existence of super (a, d)-H-antimagic total labeling was proven. At the second step, the algorithm for utilizing the labeling to construct a key stream was developed, and finally, the mechanism for applying the key to establish a stream cipher was constructed. As the result, according to the security analysis, it can be shown that the developed cryptographic system achieve a good security.
Co-Authors A. Y. Harsya Agustina Muharromah, Agustina Alfian Yulia Harsya, Alfian Yulia Arika Indah Kriatiana D. Dafik Dafik Dafik Dwi Agustin Retnowardani Firdaus Ubaidillah, Firdaus Gembong A. W. Hani'ah Zakin Herninda Lucky Oktaviana Ida Ariska Imro’atun Rofikah Ismail Naci Cangul Karinda Rizqy Aprilia, Karinda Rizqy Kiki Kurdianto Kosala Dwidja Purnomo Kurniawati, Elsa Yuli Kusbudiono Kusbudiono, Kusbudiono Larasati, Indry Marsidi Marsidi N. Mohanapriya Novian Nur Fatihah Nur Asia Jamil, Nur Asia Nuraeni Mauliddatul Fikria Prihandini, Rafiantika Megahnia Putri Rizky H.P, Putri Rizky Rafiantika Megahnia Prihandini Reyka Bella Desvandai Ridho Alfarisi, Ridho Riza Nurfadila S Slamin Sherly Citra Wuni, Sherly Citra Sih Muhni Yunika, Sih Muhni Siswono, Hendrik Siti Aminatus Solehah Siti Latifah Ukas Alif Fuadi Viqedina Rizky Noviyanti Yessy Eki Fajar Reksi