Article Per Year (5 Year)
p-Index From 2021 - 2026
2.554
P-Index
This Author published in this journals
All Journal Electronic Journal of Graph Theory and Applications (EJGTA) Bulletin of Electrical Engineering and Informatics Journal of the Indonesian Mathematical Society Jurnal Matematika & Sains Journal of Mathematical and Fundamental Sciences Indonesian Journal of Combinatorics
Edy Tri Baskoro
Institut Teknologi Bandung
Astronomy Chemistry Computer Science & IT Decision Sciences, Operations Research & Management Earth & Planetary Sciences Electrical & Electronics Engineering Mathematics Physics

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

Found 41 Documents
Search

 1   2   3   4   5 
All unicyclic graphs of order n with locating-chromatic number n-3 Edy Tri Baskoro; Arfin Arfin
Indonesian Journal of Combinatorics Vol 5, No 2 (2021)
Publisher : Indonesian Combinatorial Society (InaCombS)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.19184/ijc.2021.5.2.3

Abstract

Characterizing all graphs having a certain locating-chromatic number is not an easy task. In this paper, we are going to pay attention on finding all unicyclic graphs of order n (⩾ 6) and having locating-chromatic number n-3.
The local metric dimension of split and unicyclic graphs Dinny Fitriani; Anisa Rarasati; Suhadi Wido Saputro; Edy Tri Baskoro
Indonesian Journal of Combinatorics Vol 6, No 1 (2022)
Publisher : Indonesian Combinatorial Society (InaCombS)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.19184/ijc.2022.6.1.3

Abstract

A set W is called a local resolving set of G if the distance of u and v to some elements of W are distinct for every two adjacent vertices u and v in G.  The local metric dimension of G is the minimum cardinality of a local resolving set of G.  A connected graph G is called a split graph if V(G) can be partitioned into two subsets V1 and V2 where an induced subgraph of G by V1 and V2 is a complete graph and an independent set, respectively.  We also consider a graph, namely the unicyclic graph which is a connected graph containing exactly one cycle.  In this paper, we provide a general sharp bounds of local metric dimension of split graph.  We also determine an exact value of local metric dimension of any unicyclic graphs.
Multipartite Ramsey numbers for the union of stars I Wayan Palton Anuwiksa; Rinovia Simanjuntak; Edy Tri Baskoro
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 10, No 2 (2022): Electronic Journal of Graph Theory and Applications
Publisher : GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.5614/ejgta.2022.10.2.21

Abstract

Let s and k be positive integers with k ≥ 2 and G1, G2, …, Gk be simple graphs. The set multipartite Ramsey number, denoted by Ms(G1, G2, …, Gk), is the smallest positive integer c such that any k-coloring of the edges of Kc × s contains a monochromatic copy of Gi in color i for some i ∈ {1, 2, …, k}. The size multipartite Ramsey number, denoted by mc(G1, G2, …, Gk), is the smallest positive integer s such that any k-coloring of the edges of Kc × s contains a monochromatic copy of Gi in color i for some i ∈ {1, 2, …, k}. In this paper, we establish some lower and upper bounds, and some exact values of multipartite Ramsey numbers for the union of stars.
The total vertex irregularity strength of symmetric cubic graphs of the Foster's Census Rika Yanti; Gregory Benedict Tanidi; Suhadi Wido Saputro; Edy Tri Baskoro
Indonesian Journal of Combinatorics Vol 6, No 2 (2022)
Publisher : Indonesian Combinatorial Society (InaCombS)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.19184/ijc.2022.6.2.3

Abstract

Foster (1932) performed a mathematical census for all connected symmetric cubic (trivalent) graphs of order n with n ≤ 512. This census then was continued by Conder et al. (2006) and they obtained the complete list of all connected symmetric cubic graphs with order n ≤ 768. In this paper, we determine the total vertex irregularity strength of such graphs obtained by Foster. As a result, all the values of the total vertex irregularity strengths of the symmetric cubic graphs of order n from Foster census strengthen the conjecture stated by Nurdin, Baskoro, Gaos & Salman (2010), namely ⌈(n+3)/4⌉.
The dominant edge metric dimension of graphs Mostafa Tavakoli; Meysam Korivand; Ahmad Erfanian; Gholamreza Abrishami; Edy Tri Baskoro
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 11, No 1 (2023): Electronic Journal of Graph Theory and Applications
Publisher : GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.5614/ejgta.2023.11.1.16

Abstract

For an ordered subset S = {v1, …, vk} of vertices in a connected graph G and an edge e′ of G, the edge metric S-representation of e′=ab is the vector rGe(e′|S)=(dG(e′,v1),…,dG(e′,vk)) , where dG(e′,vi)=min{dG(a, vi),dG(b, vi)}. A dominant edge metric generator for G is a vertex cover S of G such that the edges of G have pairwise different edge metric S-representations. A dominant edge metric generator of smallest size of G is called a dominant edge metric basis for G. The size of a dominant edge metric basis of G is denoted by Ddime(G) and is called the dominant edge metric dimension. In this paper, the concept of dominant edge metric dimension (DEMD for short) is introduced and its basic properties are studied. Moreover, NP-hardness of computing DEMD of connected graphs is proved. Furthermore, this invariant is investigated under some graph operations at the end of the paper.
On Ramsey (C4, K1, n)-minimal graphs Hilda Assiyatun; Maya Nabila; Edy Tri Baskoro
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 11, No 1 (2023): Electronic Journal of Graph Theory and Applications
Publisher : GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.5614/ejgta.2023.11.1.12

Abstract

Let F, G and H be any simple graphs. The notation F → (G, H) means for any red-blue coloring on the edges of graph F, there exists either a red copy of G or a blue copy of H. If F → (G, H), then graph F is called a Ramsey graph for (G, H). Additionally, if the graph F satisfies that F − e ↛ (G, H) for any edge e of F, then graph F is called a Ramsey (G, H)-minimal. The set of all Ramsey (G, H)-minimal graphs is denoted by ℛ(G, H). In this paper, we construct a new class of Ramsey (C4, K1, n)-minimal graphs. 
A note on vertex irregular total labeling of trees Faisal Susanto; Rinovia Simanjuntak; Edy Tri Baskoro
Indonesian Journal of Combinatorics Vol 7, No 1 (2023)
Publisher : Indonesian Combinatorial Society (InaCombS)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.19184/ijc.2023.7.1.1

Abstract

The total vertex irregularity strength of a graph G=(V,E) is the minimum integer k so that there is a mapping from V ∪ E to the set {1,2,...,k} so that the vertex-weights (i.e., the sum of labels of a vertex together with the edges incident to it) are all distinct. In this note, we present a new sufficient condition for a tree to have total vertex irregularity strength ⌈(n1+1)/2⌉, where n1 is the number of vertices of degree one in the tree.
The dominating partition dimension and locating-chromatic number of graphs Muhammad Ridwan; Hilda Assiyatun; Edy Tri Baskoro
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 11, No 2 (2023): Electronic Journal of Graph Theory and Applications
Publisher : GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.5614/ejgta.2023.11.2.10

Abstract

For every graph G, the dominating partition dimension of G is either the same as its partition dimension or one higher than its partition dimension. In this paper, we consider some general connections among these three graph parameters: partition dimension, locating-chromatic number, and dominating partition dimension. We will show that βp(G)≤ηp(G)≤χL(G) for any graph G with at least 3 vertices. Therefore, we will derive properties for which graphs G have ηp(G)=βp(G) or ηp(G)=βp(G)+1.
Edge-locating coloring of graphs Korivand, Meysam; Mojdeh, Doost Ali; Baskoro, Edy Tri; Erfanian, Ahmad
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 12, No 1 (2024): Electronic Journal of Graph Theory and Applications
Publisher : GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.5614/ejgta.2024.12.1.6

Abstract

An edge-locating coloring of a simple connected graph G is a partition of its edge set into matchings such that the vertices of G are distinguished by the distance to the matchings. The minimum number of the matchings of G that admits an edge-locating coloring is the edge-locating chromatic number of G, and denoted by χ′L(G). This paper introduces and studies the concept of edge-locating coloring. Graphs G with χ′L(G)∈{2, m} are characterized, where m is the size of G. We investigate the relationship between order, diameter and edge-locating chromatic number. We obtain the exact values of χ′L(Kn) and χ′L(Kn − M), where M is a maximum matching; indeed this result is also extended for any graph. We determine the edge-locating chromatic number of the join graphs of some well-known graphs. In particular, for any graph G, we show a relationship between χ′L(G + K1) and Δ(G). We investigate the edge-locating chromatic number of trees and present a characterization bound for any tree in terms of maximum degree, number of leaves, and the support vertices of trees. Finally, we prove that any edge-locating coloring of a graph is an edge distinguishing coloring.
Vertex and edge labelling strategies for graph-based computed tomography image denoising Iwan Setiawan; Didi Rosiyadi; Rina Ratianingsih; Maulidyani Abu; Edy Tri Baskoro
Bulletin of Electrical Engineering and Informatics Vol 15, No 2: April 2026
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/eei.v15i2.11306

Abstract

Low-dose computed tomography (LDCT) reduces radiation exposure but introduces elevated noise and streak artifacts that degrade structural fidelity. This paper proposes a graph-based LDCT denoising framework that stabilizes graph construction through explicit vertex and edge labelling guided by paired full-dose CT (FDCT) data. The overlapping LDCT patches are modeled as vertices, and FD-guided affinities are used to build a structurally consistent adjacency matrix and a Laplacian spectrum that are less sensitive to noise. Denoising is performed by spectral filtering via spectral graph wavelet transform (SGWT), followed by overlap–add patch aggregation for image reconstruction. Experiments on paired LDCT/FDCT slices (318 pairs) show that FD-guided labelling improves denoising quality compared with conventional filters and non-guided graph baselines. Quantitative results demonstrate higher peak signal-to-noise ratio (PSNR)/structural similarity index measure (SSIM) with improved edge and feature preservation, indicating better structural boundary retention under noise suppression.
Co-Authors A Asmiati Ahmad Erfanian Amir Rehman Anisa Rarasati Arfin Arfin Bana Kartasasmita Bana Kartasasmita Brilly Maxel Salindeho BUDI RAHADJENG Chula Janak Jayawardene Debi Oktia Haryeni Debi Oktia Haryeni Debi Oktia Haryeni Denny Riama Silaban Denny Riama Silaban Dian Kastika Syofyan Dian Kastika Syofyan Didi Rosiyadi Dinny Fitriani Djoko Suprijanto Enik Noviani Erfanian, Ahmad Faisal Susanto Gholamreza Abrishami Gregory Benedict Tanidi Hilal A Ganie Hilda Assiyatun Hilda Assiyatun Hilda Assiyatun Hilda Assiyatun Hilda Assiyatun Hilda Assiyatun Hilda Assiyatun Hilda Assiyatun, Hilda I Made Arnawa I Made Arnawa I Wayan Palton Anuwiksa Iwan Setiawan Josef Siran Korivand, Meysam Kristiana Wijaya Lilanthi Samarasekara Lusiani, Anie Maulidyani Abu Meysam Korivand Mir Riyaz Ul Rashid Mirka Miller Mojdeh, Doost Ali Mostafa Tavakoli Muhammad Kamran Siddiqui Muhammad Ridwan Muhammad Salman Alfarisi Nawawi Mushtaq Shah N. Nurdin Nabila, Maya Nobuaki Obata Nurdin Nurdin Ratih Suryaningsih Rika Yanti Rina Ratianingsih Rinovia Simanjuntak Rinovia Simanjuntak Rinovia Simanjuntak Rinovia Simanjuntak Rinovia Simanjuntak Saladin Uttunggadewa Saladin Uttunggadewa Saladin Uttunggadewa Salindeho, Brilly Maxel Shariefuddin Pirzada Shariefuddin Pirzada Suhadi Wido Saputro Suhadi Wido Saputro Suhadi Wido Saputro Suhadi Wido Saputro Suhadi Wido Saputro Suhadi Wido Saputro Susilawati, S. Syafrizal Sy Utari sumarno Utari sumarno