Garuda - Garba Rujukan Digital

p-Index From 2021 - 2026

2.147

P-Index

This Author published in this journals

All Journal Electronic Journal of Graph Theory and Applications (EJGTA) 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

Author-ID : 2448754

Astronomy Chemistry Computer Science & IT Decision Sciences, Operations Research & Management Earth & Planetary Sciences Electrical & Electronics Engineering Mathematics Physics

Published : 39 Documents Claim Missing Document

Claim Missing Document

Articles

Title

On the Ramsey number of 4-cycle versus wheel Enik Noviani; Edy Tri Baskoro
Indonesian Journal of Combinatorics Vol 1, No 1 (2016)
Publisher : Indonesian Combinatorial Society (InaCombS)

For any fixed graphs $G$ and $H$, the Ramsey number $R(G,H)$ is the smallest positive integer $n$ such that for every graph $F$ on $n$ vertices must contain $G$ or the complement of $F$ contains $H$. The girth of graph $G$ is a length of the shortest cycle. A $k$-regular graph with the girth $g$ is called a $(k,g)$-graph. If the number of of vertices in $(k,g)$-graph is minimized then we call this graph a $(k,g)$-cage. In this paper, we derive the bounds of Ramsey number $R(C_4,W_n)$ for some values of $n$. By modifying $(k, 5)$-graphs, for $k = 7$ or $9$, we construct these corresponding $(C_4,W_n)$-good graphs.

Locating-chromatic number of the edge-amalgamation of trees Hilda Assiyatun; Dian Kastika Syofyan; Edy Tri Baskoro
Indonesian Journal of Combinatorics Vol 4, No 2 (2020)
Publisher : Indonesian Combinatorial Society (InaCombS)

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

The investigation on the locating-chromatic number for graphs was initially studied by Chartrand et al. on 2002. This concept is in fact a special case of the partition dimension for graphs. Even though this topic has received much attention, the current progress is still far from satisfaction. We can define the locating-chromatic number of a graph G as the smallest integer k such that there exists a proper k-coloring on the vertex-set of G such that all vertices have distinct coordinates (color codes) with respect to this coloring. Not like the metric dimension of any tree which is completely solved, the locating-chromatic number for most types of trees are still open. In this paper, we study the locating-chromatic number of trees. In particular, we give lower and upper bounds of the locating-chromatic number of trees formed by an edge-amalgamation of the collection of smaller trees. We also show that the bounds are tight.

On size multipartite Ramsey numbers for stars Anie Lusiani; Edy Tri Baskoro; Suhadi Wido Saputro
Indonesian Journal of Combinatorics Vol 3, No 2 (2019)
Publisher : Indonesian Combinatorial Society (InaCombS)

Burger and Vuuren defined the size multipartite Ramsey number for a pair of complete, balanced, multipartite graphs mj(Kaxb,Kcxd), for natural numbers a,b,c,d and j, where a,c >= 2, in 2004. They have also determined the necessary and sufficient conditions for the existence of size multipartite Ramsey numbers mj(Kaxb,Kcxd). Syafrizal et al. generalized this definition by removing the completeness requirement. For simple graphs G and H, they defined the size multipartite Ramsey number mj(G,H) as the smallest natural number t such that any red-blue coloring on the edges of Kjxt contains a red G or a blue H as a subgraph. In this paper, we determine the necessary and sufficient conditions for the existence of multipartite Ramsey numbers mj(G,H), where both G and H are non complete graphs. Furthermore, we determine the exact values of the size multipartite Ramsey numbers mj(K1,m, K1,n) for all integers m,n >= 1 and j = 2,3, where K1,m is a star of order m+1. In addition, we also determine the lower bound of m3(kK1,m, C3), where kK1,m is a disjoint union of k copies of a star K1,m and C3 is a cycle of order 3.

The locating-chromatic number and partition dimension of fibonacene graphs Ratih Suryaningsih; Edy Tri Baskoro
Indonesian Journal of Combinatorics Vol 3, No 2 (2019)
Publisher : Indonesian Combinatorial Society (InaCombS)

Fibonacenes are unbranched catacondensed benzenoid hydrocarbons in which all the non-terminal hexagons are angularly annelated. A hexagon is said to be angularly annelated if the hexagon is adjacent to exactly two other hexagons and possesses two adjacent vertices of degree 2. Fibonacenes possess remarkable properties related with Fibonacci numbers. Various graph properties of fibonacenes have been extensively studied, such as their saturation numbers, independence numbers and Wiener indices. In this paper, we show that the locating-chromatic number of any fibonacene graph is 4 and the partition dimension of such a graph is 3.

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

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

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.

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

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⌉.

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

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.

Co-Authors A Asmiati Ahmad Erfanian 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 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 Josef Siran Korivand, Meysam Kristiana Wijaya Lilanthi Samarasekara Lusiani, Anie Maya Nabila Maya Nabila Meysam Korivand Mirka Miller Mojdeh, Doost Ali Mostafa Tavakoli Muhammad Kamran Siddiqui Muhammad Ridwan Muhammad Salman Alfarisi Nawawi Mushtaq Shah N. Nurdin Nobuaki Obata Nurdin Nurdin Ratih Suryaningsih Rika Yanti 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

Title Search

Found 8 Documents Search Journal : Indonesian Journal of Combinatorics

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Title

Found 8 Documents
Search
Journal : Indonesian Journal of Combinatorics