Diah Junia Eksi Palupi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Diah Junia Eksi Palupi has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Indah Emilia Wijayanti
Universitas Gadjah Mada
1 shared publication - Ismudiono Ismudiono
Divisi Reproduksi, Fakultas Kedokteran Hewan, Universitas Airlangga, Surabaya
1 shared publication Lucia Ratnasari
Department of Mathematics, Universitas Diponegoro, Semarang, Indonesia
1 shared publication- Martianus Frederic Ezerman
School of Physical and Mathematical Sciences, Nanyang Technological University, Singapore, Singapore
1 shared publication - Musthofa Musthofa
Program Studi Matematika Universitas Negeri Yogyakarta
1 shared publication - Sri Wahyuni
Department of Mathematics, Universitas Gadjah Mada
1 shared publication
Latest Publications
- Open Access
- 25 July 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (15) , 2577
A New Approach to Determine the Minimal Polynomials of Binary Modified de Bruijn Sequences
A binary modified de Bruijn sequence is an infinite and periodic binary sequence derived by removing a zero from the longest run of zeros in a binary de Bruijn sequence. The minimal polynomial of the modified sequence is its unique least-degree characteristic polynomial. Leveraging a recent characterization, we devise a novel general approach to determine the minimal polynomial. We translate the characterization into a problem of identifying a Hamiltonian cycle in a specially constructed graph. The graph is isomorphic to the modified de Bruijn–Good graph. Along the way, we demonstrate the usefulness of some computational tools from the cycle joining method in the modified setup.
- 25 July 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (15) , 2577
Open AccessA New Approach to Determine the Minimal Polynomials of Binary Modified de Bruijn Sequences
A binary modified de Bruijn sequence is an infinite and periodic binary sequence derived by removing a zero from the longest run of zeros in a binary de Bruijn sequence. The minimal polynomial of the modified sequence is its unique least-degree characteristic polynomial. Leveraging a recent characterization, we devise a novel general approach to determine the minimal polynomial. We translate the characterization into a problem of identifying a Hamiltonian cycle in a specially constructed graph. The graph is isomorphic to the modified de Bruijn–Good graph. Along the way, we demonstrate the usefulness of some computational tools from the cycle joining method in the modified setup.
- Open Access
- 22 April 2022
- Published by Universitas Airlangga in Jurnal Medik Veteriner
- Vol. 5 (1) , 124-130
Medical Treatment for Pyometra in Cat
The Pyometra case is a case that is often found in Female Cat. This case report will discuss the handling of a case of pyometra in a 7-year-old mixed breed cat who is being treated at Harmoni Pet Care, Menanggal, Gayungan, Surabaya, Indonesia. Reports from the owner that these cats are still in good appetite but sanguino-purulent discharge from the vagina was found. In clinically diagnosed with a pyometra, the treatment used to treat pyometra case was ovariohysterectomy. Postoperative care was carried out by administering antibiotics (Clanexi; Amoxicillin-Clavulanic Acid, 1 cc/kg, IM) given twice a day for 14 days, with the first 3 days being treated in the Harmoni Pet Care inpatient room and the 4th day to the 14th day of care is done at the owner's house, local antiseptic dressing at the incision site is continued for up to 14 days until the sutures in the skin sutures were absorbed by the cat's body.
- 22 April 2022
- Published by Universitas Airlangga in Jurnal Medik Veteriner
- Vol. 5 (1) , 124-130
Open AccessMedical Treatment for Pyometra in Cat
The Pyometra case is a case that is often found in Female Cat. This case report will discuss the handling of a case of pyometra in a 7-year-old mixed breed cat who is being treated at Harmoni Pet Care, Menanggal, Gayungan, Surabaya, Indonesia. Reports from the owner that these cats are still in good appetite but sanguino-purulent discharge from the vagina was found. In clinically diagnosed with a pyometra, the treatment used to treat pyometra case was ovariohysterectomy. Postoperative care was carried out by administering antibiotics (Clanexi; Amoxicillin-Clavulanic Acid, 1 cc/kg, IM) given twice a day for 14 days, with the first 3 days being treated in the Harmoni Pet Care inpatient room and the 4th day to the 14th day of care is done at the owner's house, local antiseptic dressing at the incision site is continued for up to 14 days until the sutures in the skin sutures were absorbed by the cat's body.
- Open Access
- 19 December 2019
- Published by AIP Publishing in AIP Conference Proceedings
- Vol. 2192 (1) , 040013
Total edge irregularity strength of book graphs and double book graphs
Let G(V, E) be a finite, simple and undirected graph with a vertex set V and an edge set E. An edge irregular total k-labeling is a map f : V ∪ E → {1, 2, …, k} such that for any two different edges xy and x’y’ in E, ω(xy) ≠ ω(x’y’) where ω(xy) = f(x) + f(y) + f(xy). The minimum k for which the graph G admits an edge irregular total k-labeling is called the total edge irregularity strength of G, denoted by tes(G). In this paper, we show the exact value of the total edge irregularity strength of any book graph of m sides and n sheets Bn(Cm) and of any double book graph of m sides and 2n sheets 2Bn(Cm).
- 19 December 2019
- Published by AIP Publishing in AIP Conference Proceedings
- Vol. 2192 (1) , 040013
Open AccessTotal edge irregularity strength of book graphs and double book graphs
Let G(V, E) be a finite, simple and undirected graph with a vertex set V and an edge set E. An edge irregular total k-labeling is a map f : V ∪ E → {1, 2, …, k} such that for any two different edges xy and x’y’ in E, ω(xy) ≠ ω(x’y’) where ω(xy) = f(x) + f(y) + f(xy). The minimum k for which the graph G admits an edge irregular total k-labeling is called the total edge irregularity strength of G, denoted by tes(G). In this paper, we show the exact value of the total edge irregularity strength of any book graph of m sides and n sheets Bn(Cm) and of any double book graph of m sides and 2n sheets 2Bn(Cm).