Article Per Year (5 Year)
p-Index From 2021 - 2026
2.064
P-Index
This Author published in this journals
All Journal MAGISTRA BAREKENG: Jurnal Ilmu Matematika dan Terapan Indonesian Journal of Combinatorics Jurnal Matematika UNAND Jurnal Saintika Unpam : Jurnal Sains dan Matematika Unpam InPrime: Indonesian Journal Of Pure And Applied Mathematics Majalah Ilmiah Matematika dan Statistika (MIMS) Pattimura Proceeding : Conference of Science and Technology Pattimura International Journal of Mathematics (PIJMath) Jurnal Matematika Integratif
Kiki Ariyanti Sugeng
Departemen Matematika, Fakultas Matematika Dan Ilmu Pengetahuan Alam, Universitas Indonesia
Agriculture, Biological Sciences & Forestry Astronomy Biochemistry, Genetics & Molecular Biology Chemical Engineering, Chemistry & Bioengineering Chemistry Civil Engineering, Building, Construction & Architecture Computer Science & IT Control & Systems Engineering Decision Sciences, Operations Research & Management Economics, Econometrics & Finance Education Electrical & Electronics Engineering Energy Engineering Materials Science & Nanotechnology Mathematics Mechanical Engineering Physics Transportation

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

Found 2 Documents
Search
Journal : Jurnal Matematika UNAND

 1 
On Characteristic Polynomial of Antiadjacency Matrix of A Line Digraph Muhammad Irfan Arsyad Prayitno; Kiki Ariyanti Sugeng
Jurnal Matematika UNAND Vol 11, No 1 (2022)
Publisher : Jurusan Matematika FMIPA Universitas Andalas Padang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.25077/jmu.11.1.74-81.2022

Abstract

In this paper, we find the characteristic polynomial of the antiadjacency matrix of a line digraph. There are recent studies on the relation between the characteristic polynomial of the adjacency matrix and its line digraph, we are also interested in finding the connection between the antiadjacency matrix of a digraph and its line digraph. In this paper, we show the connection of characteristic polynomial of the antiadjacency matrix between an acyclic digraph and its line digraph.
Inclusive Distance Antimagic Labeling of Shadow Graph of Complete and Circulant Graph Arafah, Siti Hafshah Nurul; Sugeng, Kiki Ariyanti; Haryeni, Debi Oktia
Jurnal Matematika UNAND Vol. 15 No. 1 (2026)
Publisher : Departemen Matematika dan Sains Data FMIPA Universitas Andalas Padang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.25077/jmua.15.1.57-62.2026

Abstract

Consider a graph $G = (V, E)$ with order $n$. Suppose that we have a bijection $f: V(G) \to \{1, 2, ..., n\}$. A graph $G$ is said to admit an inclusive distance antimagic labeling if every pair of distinct vertices has different weights, with a vertex weight is defined by $w(v) = \sum_{u \in N(v)} f(u) + f(v)$. Furthermore, if the vertex weights form an arithmetic progression with the first term $a$ and the common difference $d$, then $G$ is said to admit an $(a,d)$-inclusive distance antimagic labeling. This paper investigates the inclusive distance antimagic labeling of the shadow graph of the complete and circulant graph.
Co-Authors Afifan Hadi Arafah, Siti Hafshah Nurul Barack, Zeveliano Zidane Daniel, Juan Denny R. Silaban Denny Silaban Fery Firmansah Hariadi, Nora Haryeni, Debi Oktia Hirawati Lubis Ilham, Pandu Setya Irawan, Wahri Juan Daniel Kevin Akbar Listyaningrum, Rostika Muhammad Irfan Arsyad Prayitno Nugroho, Eri Paradise, Fadila Prayitno, Muhammad Irfan Arsyad Rizqi Rachmadhani Rostika Listyaningrum