Article Per Year (5 Year)
p-Index From 2020 - 2025
0.444
P-Index
This Author published in this journals
All Journal Electronic Journal of Graph Theory and Applications (EJGTA) Journal of the Indonesian Mathematical Society
A.N.M. Salman
Institut Teknologi Bandung
Electrical & Electronics Engineering Mathematics

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

Found 3 Documents
Search

 1 
The strong 3-rainbow index of edge-comb product of a path and a connected graph Zata Yumni Awanis; A.N.M. Salman; Suhadi Wido Saputro
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 10, No 1 (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.1.3

Abstract

Let G be a connected and edge-colored graph of order n, where adjacent edges may be colored the same. A tree in G is a rainbow tree if all of its edges have distinct colors. Let k be an integer with 2 ≤ k ≤ n. The minimum number of colors needed in an edge coloring of G such that there exists a rainbow tree connecting S with minimum size for every k-subset S of V(G) is called the strong k-rainbow index of G, denoted by srxk(G). In this paper, we study the srx3 of edge-comb product of a path and a connected graph, denoted by Pno⊳eH. It is clearly that |E(Pno⊳eH)| is the trivial upper bound for srx3(Pno⊳eH). Therefore, in this paper, we first characterize connected graphs H with srx3(Pno⊳eH)=|E(Pno⊳eH)|, then provide a sharp upper bound for srx3(Pno⊳eH) where srx3(Pno⊳eH)≠|E(Pno⊳eH)|. We also provide the exact value of srx3(Pno⊳eH) for some connected graphs H.
THE METRIC DIMENSION OF A GRAPH COMPOSITION PRODUCTS WITH STAR S.W. Saputro; D. Suprijanto; Edi Tri Baskoro; A.N.M. Salman
Journal of the Indonesian Mathematical Society Volume 18 Number 2 (October 2012)
Publisher : IndoMS

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.22342/jims.18.2.114.85-92

Abstract

looked at pdf abstractDOI : http://dx.doi.org/10.22342/jims.18.2.114.85-92
On (F, H)-simultaneously-magic labelings of graphs Yeva Fadhilah Ashari; A.N.M. Salman; Rinovia Simanjuntak; Andrea Semaničová-Feňovčíková; Martin Baca
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.5

Abstract

A simple graph G(V, E) admits an H-covering if every edge in G belongs to a subgraph of G isomorphic to H. In this case, G is called H-magic if there exists a bijective function f : V ∪ E → {1, 2, …, |V|+|E|}, such that for every subgraph H′ of G isomorphic to H, wtf(H′) =  Σv ∈ V(H′)f(v)+ Σe ∈ E(H′)f(e) is constant. Moreover, G is called H-supermagic if f : V(G)→{1, 2, …, |V|}. This paper generalizes the previous labeling by introducing the (F, H)-sim-(super) magic labeling. A graph admitting an F-covering and an H-covering is called (F, H)-sim-(super) magic if there exists a function f that is F-(super)magic and H-(super)magic at the same time. We consider such labelings for two product graphs: the join product and the Cartesian product. In particular, we establish a sufficient condition for the join product G + H to be (K2 + H, 2K2 + H)-sim-supermagic and show that the Cartesian product G × K2 is (C4, H)-sim-supermagic, for H isomorphic to a ladder or an even cycle. Moreover, we also present a connection between an α-labeling of a tree T and a (C4, C6)-sim-supermagic labeling of the Cartesian product T × K2.
Co-Authors Andrea Semaničová-Feňovčíková D. Suprijanto Edi Tri Baskoro Martin Baca Rinovia Simanjuntak S.W. Saputro Suhadi Wido Saputro Yeva Fadhilah Ashari Zata Yumni Awanis