Article Per Year (5 Year)
p-Index From 2019 - 2024
0.444
P-Index
This Author published in this journals
All Journal Journal of the Indonesian Mathematical Society
Hilda Assiyatun, Hilda
Combinatorial Mathematics Research Group Faculty of Mathematics and Natural Sciences Institut Teknologi Bandung
Mathematics

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

Found 2 Documents
Search

 1 
On The Total Edge and Vertex Irregularity Strength of Some Graphs Obtained from Star Ramdani, Rismawati; Salman, A.N.M; Assiyatun, Hilda
Journal of the Indonesian Mathematical Society Volume 25 Number 3 (November 2019)
Publisher : IndoMS

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

Abstract

Let $G=(V(G),E(G))$ be a graph and $k$ be a positive integer. A total $k$-labeling of $G$ is a map $f: V(G)\cup E(G)\rightarrow \{1,2,\ldots,k \}$. The edge weight $uv$ under the labeling $f$ is denoted by $w_f(uv)$ and defined by $w_f(uv)=f(u)+f(uv)+f(v)$. The vertex weight $v$ under the labeling $f$ is denoted by $w_f(v)$ and defined by $w_f(v) = f(v) + \sum_{uv \in{E(G)}} {f(uv)}$. A total $k$-labeling of $G$ is called an edge irregular total $k$-labeling of $G$ if  $w_f(e_1)\neq w_f(e_2)$ for every two distinct edges $e_1$ and $e_2$  in $E(G)$.  The total edge irregularity strength of $G$, denoted by $tes(G)$, is the minimum $k$ for which $G$ has an edge irregular total $k$-labeling.  A total $k$-labeling of $G$ is called a vertex irregular total $k$-labeling of $G$ if  $w_f(v_1)\neq w_f(v_2)$ for every two distinct vertices $v_1$ and $v_2$ in $V(G)$.  The total vertex irregularity strength of $G$, denoted by $tvs(G)$, is the minimum $k$ for which $G$ has a vertex irregular total $k$-labeling.  In this paper, we determine the total edge irregularity strength and the total vertex irregularity strength of some graphs obtained from star, which are gear, fungus, and some copies of stars.
On The Locating-Chromatic Numbers of Subdivisions of Friendship Graph Salindeho, Brilly Maxel; Assiyatun, Hilda; Baskoro, Edy Tri
Journal of the Indonesian Mathematical Society Volume 26 Number 2 (July 2020)
Publisher : IndoMS

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

Abstract

Let c be a k-coloring of a connected graph G and let pi={C1,C2,...,Ck} be the partition of V(G) induced by c. For every vertex v of G, let c_pi(v) be the coordinate of v relative to pi, that is c_pi(v)=(d(v,C1 ),d(v,C2 ),...,d(v,Ck )), where d(v,Ci )=min{d(v,x)|x in Ci }. If every two vertices of G have different coordinates relative to pi, then c is said to be a locating k-coloring of G. The locating-chromatic number of G, denoted by chi_L (G), is the least k such that there exists a locating k-coloring of G. In this paper, we determine the locating-chromatic numbers of some subdivisions of the friendship graph Fr_t, that is the graph obtained by joining t copies of 3-cycle with a common vertex, and we give lower bounds to the locating-chromatic numbers of few other subdivisions of Fr_t.
Co-Authors Edy Tri Baskoro Rismawati Ramdani Salindeho, Brilly Maxel Salman, A.N.M