Kristiana Wijaya

Bandung Institute of Technology

*This is an algorithmically generated author record based on publicly available information.

See Latest Publications

See Most Cited Publications

SciProfiles

ORCID Profile

Google Scholar

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Bandung Institute of Technology

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years

Research Subjects

Graph Algorithms & Structures

Research Interests

Kristiana Wijaya has a total of 30 co-authors. Here are the top co-authors by number of shared publications:

Edy Tri Baskoro
Bandung Institute of Technology
8 shared publications
Djoko Suprijanto
Combinatorial Mathematics Research Group, Faculty of Mathematics and Natural Sciences, Institut Teknologi Bandung, Bandung, Indonesia
5 shared publications
Hilda Assiyatun
Combinatorial Mathematics Research Group, Faculty of Mathematics and Natural Sciences, Institut Teknologi Bandung, Jalan Ganesa 10, Bandung 40132, Indonesia
4 shared publications
Ikhsanul Halikin
Graph and Algebra Research Group Department of Mathematics, Faculty of Mathematics and Natural Sciences, Universitas Jember
4 shared publications
Slamin
Faculty of Computer Science, University of Jember, Jember, Indonesia
3 shared publications
Djoko Suprijanto
Combinatorial Mathematics Research Group, Faculty of Mathematics and natural Sciences, Institut Teknologi Bandung (ITB), Jalan Ganesa 10 Bandung 40132 Indonesia
2 shared publications

Latest Publications

Sort by

Open Access
Website
Google Scholar
- 30 March 2024
- Published by Universitas Muhammadiyah Mataram in JTAM (Jurnal Teori dan Aplikasi Matematika)
An Inclusive Distance Irregularity Strength of n-ary Tree
by Kristiana Wijaya, Safira Nur Aulia, Ikhsanul Halikin, Kusbudiono Kusbudiono
An Inclusive Distance Irregularity Strength of n-ary Tree
Website
Google Scholar
- 30 March 2024
- Published by Universitas Muhammadiyah Mataram in JTAM (Jurnal Teori dan Aplikasi Matematika)
Open Access
An Inclusive Distance Irregularity Strength of n-ary Tree
by Kristiana Wijaya, Safira Nur Aulia, Ikhsanul Halikin, Kusbudiono Kusbudiono
An Inclusive Distance Irregularity Strength of n-ary Tree
Open Access
Website
Google Scholar
Cited by 1
- 19 March 2024
- Published by Lembaga Penelitian dan Pengabdian kepada Masyarakat ITS in Limits: Journal of Mathematics and Its Applications
Pelabelan Koprima Pada Amalgamasi Graf Lengkap dan Graf Berlian
by Hafif Komarullah, Slamin Slamin, Kristiana Wijaya
Pelabelan Koprima Pada Amalgamasi Graf Lengkap dan Graf Berlian
Website
Google Scholar
- 19 March 2024
- Published by Lembaga Penelitian dan Pengabdian kepada Masyarakat ITS in Limits: Journal of Mathematics and Its Applications
Open Access
Pelabelan Koprima Pada Amalgamasi Graf Lengkap dan Graf Berlian
by Hafif Komarullah, Slamin Slamin, Kristiana Wijaya
Pelabelan Koprima Pada Amalgamasi Graf Lengkap dan Graf Berlian
Cited by 1
Open Access
Website
Google Scholar
Cited by 5
- 15 December 2022
- Published by Universitas Pattimura in BAREKENG: Jurnal Ilmu Matematika dan Terapan
THE HARMONIOUS, ODD HARMONIOUS, AND EVEN HARMONIOUS LABELING
by Ahmad Lasim, Ikhsanul Halikin, Kristiana Wijaya
Suppose is a simple and connected graph with edges. A harmonious labeling on a graph is an injective function so that there exists a bijective function where for each An odd harmonious labeling on a graph is an injective function from to non-negative integer set less than so that there is a function where for every An even harmonious labeling on a graph is an injective function so that there is a bijective function where for each . In this paper, we discuss how to build new labeling (harmonious, odd harmonious, even harmonious) based on the existing labeling (harmonious, odd harmonious, even harmonious)
Website
Google Scholar
- 15 December 2022
- Published by Universitas Pattimura in BAREKENG: Jurnal Ilmu Matematika dan Terapan
Open Access
THE HARMONIOUS, ODD HARMONIOUS, AND EVEN HARMONIOUS LABELING
by Ahmad Lasim, Ikhsanul Halikin, Kristiana Wijaya
Suppose is a simple and connected graph with edges. A harmonious labeling on a graph is an injective function so that there exists a bijective function where for each An odd harmonious labeling on a graph is an injective function from to non-negative integer set less than so that there is a function where for every An even harmonious labeling on a graph is an injective function so that there is a bijective function where for each . In this paper, we discuss how to build new labeling (harmonious, odd harmonious, even harmonious) based on the existing labeling (harmonious, odd harmonious, even harmonious)
Cited by 5
Website
Google Scholar
Cited by 1
- 8 February 2022
- Published by Atlantis Press SARL
On Ramsey Minimal Graphs for a 3-Matching Versus a Path on Five Vertices
by Kristiana Wijaya, Edy Tri Baskoro, Asep Iqbal Taufik, Denny Riama Silaban
Website
Google Scholar
- 8 February 2022
- Published by Atlantis Press SARL
On Ramsey Minimal Graphs for a 3-Matching Versus a Path on Five Vertices
by Kristiana Wijaya, Edy Tri Baskoro, Asep Iqbal Taufik, Denny Riama Silaban
Cited by 1
Website
Google Scholar
Cited by 2
- 1 January 2022
- Published by AGH University Press in Opuscula Mathematica
Distance irregularity strength of graphs with pendant vertices
by Faisal Susanto, Kristiana Wijaya, Slamin, Andrea Semaničová-Feňovčíková
A vertex $k$-labeling $\phi:V(G)\rightarrow\{1,2,\dots,k\}$ on a simple graph $G$ is said to be a distance irregular vertex $k$-labeling of $G$ if the weights of all vertices of $G$ are pairwise distinct, where the weight of a vertex is the sum of labels of all vertices adjacent to that vertex in $G$. The least integer $k$ for which $G$ has a distance irregular vertex $k$-labeling is called the distance irregularity strength of $G$ and denoted by $\mathrm{dis}(G)$. In this paper, we introduce a new lower bound of distance irregularity strength of graphs and provide its sharpness for some graphs with pendant vertices. Moreover, some properties on distance irregularity strength for trees are also discussed in this paper.
Website
Google Scholar
- 1 January 2022
- Published by AGH University Press in Opuscula Mathematica
Distance irregularity strength of graphs with pendant vertices
by Faisal Susanto, Kristiana Wijaya, Slamin, Andrea Semaničová-Feňovčíková
A vertex $k$-labeling $\phi:V(G)\rightarrow\{1,2,\dots,k\}$ on a simple graph $G$ is said to be a distance irregular vertex $k$-labeling of $G$ if the weights of all vertices of $G$ are pairwise distinct, where the weight of a vertex is the sum of labels of all vertices adjacent to that vertex in $G$. The least integer $k$ for which $G$ has a distance irregular vertex $k$-labeling is called the distance irregularity strength of $G$ and denoted by $\mathrm{dis}(G)$. In this paper, we introduce a new lower bound of distance irregularity strength of graphs and provide its sharpness for some graphs with pendant vertices. Moreover, some properties on distance irregularity strength for trees are also discussed in this paper.
Cited by 2
Open Access
Website
Google Scholar
Cited by 4
- 28 December 2021
- Published by UPT Penerbitan Universitas Jember in Indonesian Journal of Combinatorics
Odd Harmonious Labeling of Pn ⊵ C4 and Pn ⊵ D2(C4)
by Sabrina Shena Sarasvati, Ikhsanul Halikin, Kristiana Wijaya
A graph G with q edges is said to be odd harmonious if there exists an injection f:V(G) → ℤ2q so that the induced function f*:E(G)→ {1,3,...,2q-1} defined by f*(uv)=f(u)+f(v) is a bijection.Here we show that graphs constructed by edge comb product of path Pn and cycle on four vertices C4 or shadow of cycle of order four D2(C4) are odd harmonious.
Website
Google Scholar
- 28 December 2021
- Published by UPT Penerbitan Universitas Jember in Indonesian Journal of Combinatorics
Open Access
Odd Harmonious Labeling of Pn ⊵ C4 and Pn ⊵ D2(C4)
by Sabrina Shena Sarasvati, Ikhsanul Halikin, Kristiana Wijaya
A graph G with q edges is said to be odd harmonious if there exists an injection f:V(G) → ℤ2q so that the induced function f*:E(G)→ {1,3,...,2q-1} defined by f*(uv)=f(u)+f(v) is a bijection.Here we show that graphs constructed by edge comb product of path Pn and cycle on four vertices C4 or shadow of cycle of order four D2(C4) are odd harmonious.
Cited by 4
Open Access
Website
Google Scholar
Cited by 10
- 2 November 2021
- Published by MDPI AG in Symmetry
Another Antimagic Conjecture
by Rinovia Simanjuntak, Tamaro Nadeak, Fuad Yasin, Kristiana Wijaya, Nurdin Hinding, Kiki Ariyanti Sugeng
An antimagic labeling of a graph G is a bijection $f : E (G) \to {1, \dots, | E (G) |}$ such that the weights $w (x) = \sum_{y \sim x} f (y)$ distinguish all vertices. A well-known conjecture of Hartsfield and Ringel (1990) is that every connected graph other than $K_{2}$ admits an antimagic labeling. For a set of distances D, a D-antimagic labeling of a graph G is a bijection $f : V (G) \to {1, \dots, | V (G) |}$ such that the weight $ω (x) = \sum_{y \in N_{D} (x)} f (y)$ is distinct for each vertex x, where $N_{D} (x) = {y \in V (G) | d (x, y) \in D}$ is the D-neigbourhood set of a vertex x. If $N_{D} (x) = r$ , for every vertex x in G, a graph G is said to be $(D, r)$ -regular. In this paper, we conjecture that a graph admits a D-antimagic labeling if and only if it does not contain two vertices having the same D-neighborhood set. We also provide evidence that the conjecture is true. We present computational results that, for $D = {1}$ , all graphs of order up to 8 concur with the conjecture. We prove that the set of $(D, r)$ -regular D-antimagic graphs is closed under union. We provide examples of disjoint union of symmetric $(D, r)$ -regular that are D-antimagic and examples of disjoint union of non-symmetric non- $(D, r)$ -regular graphs that are D-antimagic. Furthermore, lastly, we show that it is possible to obtain a D-antimagic graph from a previously known distance antimagic graph.
Website
Google Scholar
- 2 November 2021
- Published by MDPI AG in Symmetry
Open Access
Another Antimagic Conjecture
by Rinovia Simanjuntak, Tamaro Nadeak, Fuad Yasin, Kristiana Wijaya, Nurdin Hinding, Kiki Ariyanti Sugeng
An antimagic labeling of a graph G is a bijection $f : E (G) \to {1, \dots, | E (G) |}$ such that the weights $w (x) = \sum_{y \sim x} f (y)$ distinguish all vertices. A well-known conjecture of Hartsfield and Ringel (1990) is that every connected graph other than $K_{2}$ admits an antimagic labeling. For a set of distances D, a D-antimagic labeling of a graph G is a bijection $f : V (G) \to {1, \dots, | V (G) |}$ such that the weight $ω (x) = \sum_{y \in N_{D} (x)} f (y)$ is distinct for each vertex x, where $N_{D} (x) = {y \in V (G) | d (x, y) \in D}$ is the D-neigbourhood set of a vertex x. If $N_{D} (x) = r$ , for every vertex x in G, a graph G is said to be $(D, r)$ -regular. In this paper, we conjecture that a graph admits a D-antimagic labeling if and only if it does not contain two vertices having the same D-neighborhood set. We also provide evidence that the conjecture is true. We present computational results that, for $D = {1}$ , all graphs of order up to 8 concur with the conjecture. We prove that the set of $(D, r)$ -regular D-antimagic graphs is closed under union. We provide examples of disjoint union of symmetric $(D, r)$ -regular that are D-antimagic and examples of disjoint union of non-symmetric non- $(D, r)$ -regular graphs that are D-antimagic. Furthermore, lastly, we show that it is possible to obtain a D-antimagic graph from a previously known distance antimagic graph.
Cited by 10
Open Access
Website
Google Scholar
Cited by 16
- 7 November 2020
- Published by MDPI AG in Symmetry
Local Super Antimagic Total Labeling for Vertex Coloring of Graphs
by Slamin Slamin, Nelly Oktavia Adiwijaya, Muhammad Ali Hasan, Dafik Dafik, Kristiana Wijaya
Let $G = (V, E)$ be a graph with vertex set V and edge set E. A local antimagic total vertex coloring f of a graph G with vertex-set V and edge-set E is an injective map from $V \cup E$ to ${1, 2, \dots, | V | + | E |}$ such that if for each $u v \in E (G)$ then $w (u) \neq w (v)$ , where $w (u) = \sum_{u v \in E (G)} f (u v) + f (u)$ . If the range set f satisfies $f (V) = {1, 2, \dots, | V |}$ , then the labeling is said to be local super antimagic total labeling. This labeling generates a proper vertex coloring of the graph G with the color $w (v)$ assigning the vertex v. The local super antimagic total chromatic number of graph G, $χ_{l s a t} (G)$ is defined as the least number of colors that are used for all colorings generated by the local super antimagic total labeling of G. In this paper we investigate the existence of the local super antimagic total chromatic number for some particular classes of graphs such as a tree, path, cycle, helm, wheel, gear, sun, and regular graphs as well as an amalgamation of stars and an amalgamation of wheels.
Website
Google Scholar
- 7 November 2020
- Published by MDPI AG in Symmetry
Open Access
Local Super Antimagic Total Labeling for Vertex Coloring of Graphs
by Slamin Slamin, Nelly Oktavia Adiwijaya, Muhammad Ali Hasan, Dafik Dafik, Kristiana Wijaya
Let $G = (V, E)$ be a graph with vertex set V and edge set E. A local antimagic total vertex coloring f of a graph G with vertex-set V and edge-set E is an injective map from $V \cup E$ to ${1, 2, \dots, | V | + | E |}$ such that if for each $u v \in E (G)$ then $w (u) \neq w (v)$ , where $w (u) = \sum_{u v \in E (G)} f (u v) + f (u)$ . If the range set f satisfies $f (V) = {1, 2, \dots, | V |}$ , then the labeling is said to be local super antimagic total labeling. This labeling generates a proper vertex coloring of the graph G with the color $w (v)$ assigning the vertex v. The local super antimagic total chromatic number of graph G, $χ_{l s a t} (G)$ is defined as the least number of colors that are used for all colorings generated by the local super antimagic total labeling of G. In this paper we investigate the existence of the local super antimagic total chromatic number for some particular classes of graphs such as a tree, path, cycle, helm, wheel, gear, sun, and regular graphs as well as an amalgamation of stars and an amalgamation of wheels.
Cited by 16
Open Access
Website
Google Scholar
Cited by 4
- 1 June 2020
- Published by Elsevier in Heliyon
Subdivision of graphs in R ( m K 2 , P 4 )
by Kristiana Wijaya, Edy Tri Baskoro, Hilda Assiyatun, Djoko Suprijanto
Website
Google Scholar
- 1 June 2020
- Published by Elsevier in Heliyon
Open Access
Subdivision of graphs in R ( m K 2 , P 4 )
by Kristiana Wijaya, Edy Tri Baskoro, Hilda Assiyatun, Djoko Suprijanto
Cited by 4
Open Access
Website
Google Scholar
Cited by 6
- 1 May 2020
- Published by IOP Publishing in Journal of Physics: Conference Series
Application of the local antimagic total labeling of graphs to optimise scheduling system for an expatriate assignment
by W Utami, K Wijaya, Slamin
An expatriate assignment at the branch company in other country must be optimised due to the short term duty. Accuracy calculation is needed to optimise the expatriate assignment including its scheduling system. There are many ways and methods to optimise the scheduling system. One of the methods is making use of graph theory instruments such as local antimagic total labeling. The local antimagic total labeling of a graph is a map from the set of vertices and edges of the graph to the set of positive integers from 1 to the number of vertices and edges such that the weight of two adjacent vertices are different. The vertex weight is calculated by adding the labels of the vertex and all edges incident to it. In this paper, this labeling is applied to optimise the scheduling system for the expatriate assignment. This system can be modelled by a graph where the assignments are represented by vertices and connection between the assignments are represented by edges. The represented graph is then labelled by the local antimagic total labeling in order to obtain the minimum number of different vertex weights. The such number is equivalent to the optimal time allocated for the expatriate assignment.
Website
Google Scholar
- 1 May 2020
- Published by IOP Publishing in Journal of Physics: Conference Series
Open Access
Application of the local antimagic total labeling of graphs to optimise scheduling system for an expatriate assignment
by W Utami, K Wijaya, Slamin
An expatriate assignment at the branch company in other country must be optimised due to the short term duty. Accuracy calculation is needed to optimise the expatriate assignment including its scheduling system. There are many ways and methods to optimise the scheduling system. One of the methods is making use of graph theory instruments such as local antimagic total labeling. The local antimagic total labeling of a graph is a map from the set of vertices and edges of the graph to the set of positive integers from 1 to the number of vertices and edges such that the weight of two adjacent vertices are different. The vertex weight is calculated by adding the labels of the vertex and all edges incident to it. In this paper, this labeling is applied to optimise the scheduling system for the expatriate assignment. This system can be modelled by a graph where the assignments are represented by vertices and connection between the assignments are represented by edges. The represented graph is then labelled by the local antimagic total labeling in order to obtain the minimum number of different vertex weights. The such number is equivalent to the optimal time allocated for the expatriate assignment.
Cited by 6

Show all