Liliek Susilowati

Liliek Susilowati

Auto-generated profile, based on publicly available information

Liliek Susilowati

Department of Mathematics, Faculty of Science and Technology, Universitas Airlangga Surabaya 60115, Indonesia

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
3 October 2017 in Journal of Mathematical and Fundamental Sciences
Verified
Journal Article
Open access
PDF file
LSLiliek Susilowati
Liliek Susilowati
MUMohammad Imam Utoyo
Mohammad Imam Utoyo
SSSlamin Slamin
Slamin Slamin
On Commutative Characterization of Graph Operation with Respect to Metric Dimension

24 January 2023 in F1000Research
Verified
Journal Article
Open access
PDF file
RARidho Alfarisi
Ridho Alfarisi
LSLiliek Susilowati
Liliek Susilowati
DDDafik Dafik
Dafik Dafik
S PrabhuS Prabhu
S Prabhu
\textbf{Background}: One of the topics of distance in graphs is the resolving set problem. Suppose the set $W=\{s_1,s_2,…,s_k\}\subset V(G)$, the vertex representations of $\in V(G)$ is $r_m(x|W)=\{d(x,s_1),d(x,s_2),…,d(x,s_k)\}$, where $d(x,s_i)$ is the length of the shortest path of the vertex $x$ and the vertex in $W$ together with their multiplicity. The set $W$ is called a local $m$-resolving set of graphs $G$ if $r_m (v|W)\neq r_m (u|W)$ for $uv\in E(G)$. The local $m$-resolving set having minimum cardinality is called the local multiset basis and its cardinality is called the local multiset dimension of $G$, denoted by $md_l(G)$. Thus, if $G$ has an infinite local multiset dimension and then we write $md_l (G)=\infty$. \\ \textbf{Methods}: This research is pure research with exploration design. There are several stages in this research, namely we choose the special graph which is operated by amalgamation and the set of vertices and edges of amalgamation of graphs; determine the set $W\subset V(G)$; determine the vertex representation of two adjacent vertices in $G$; and prove the theorem.\\ \textbf{Results}: The results of this research are an upper bound of local multiset dimension of the amalgamation of graphs namely $md_l(Amal(G,v,m))\leq m.md_l(G)$ and their exact value of local multiset dimension of some families of graphs namely $md_l(Amal(P_n,v,m))=1$, $md_l(Amal(K_n,v,m))=\infty$, $md_l(Amal(W_n,v,m))=m. md_l(W_n)$, $md_l(Amal(F_n,v,m))=m. md_l(F_n)$ for $d(v)=n$, $md_l(Amal(F_n,v,m))=m. \lfloor\frac{n}{4}\rfloor$. \\ \textbf{Conclusions}: We have found the upper bound of a local multiset dimension. There are some graphs which attain the upper bound of local multiset dimension namely wheel graphs\\

1 March 2021 in IOP Conference Series: Materials Science and Engineering
Verified
Conference Paper
Open access
PDF file
RUR Umilasari
R Umilasari
LSL Susilowati
L Susilowati
SLSlamin
Slamin
Dominant local metric dimension is consist of two interesting topic in graph theory, they are dominating and metric dimension which be expanded as local metric dimension. A graph G is said having dominant local metric dimension if G be a connected graph and there is an ordered subset W l = {W 1, W 2 …, W n }⊆V(G) where W l is a local resolving set as well as a dominating set of G. Minimum cardinality of dominant local resolving set of G is called the dominant local basis of G. Then, cardinality of the dominant local basis of G is called the dominant local metric dimension of G which denoted by Ddim l (G). In this paper, we determine the dominant local metric dimension of wheel related graphs. That are Wheel, Jahangir, Friendship and Helm graph. Furthermore, we characterize the dominant local metric dimension of those graphs.

1 January 2023 in AIMS Mathematics
Verified
Journal Article
Open access
PDF file
YLYuni Listiana
Yuni Listiana
LSLiliek Susilowati
Liliek Susilowati
SSSlamin Slamin
Slamin Slamin
FOFadekemi Janet Osaye
Fadekemi Janet Osaye
The local metric dimension is one of many topics in graph theory with several applications. One of its applications is a new model for assigning codes to customers in delivery services. Let $ G $ be a connected graph and $ V(G) $ be a vertex set of $ G $. For an ordered set $ W = \{ x_1, x_2, \ldots, x_k\} \subseteq V(G) $, the representation of a vertex $ x $ with respect to $ W $ is $ r_G(x|W) = \{(d(x, x_1), d(x, x_2), \ldots, d(x, x_k) \} $. The set $ W $ is said to be a local metric set of $ G $ if $ r(x|W)\neq r(y|W) $ for every pair of adjacent vertices $ x $ and $ y $ in $ G $. The eccentricity of a vertex $ x $ is the maximum distance between $ x $ and all other vertices in $ G $. Among all vertices in $ G $, the smallest eccentricity is called the radius of $ G $ and a vertex whose eccentricity equals the radius is called a central vertex of $ G $. In this paper, we developed a new concept, so-called the central local metric dimension by combining the concept of local metric dimension with the central vertex of a graph. The set $ W $ is a central local metric set if $ W $ is a local metric set and contains all central vertices of $ G $. The minimum cardinality of a central local metric set is called a central local metric dimension of $ G $. In the main result, we introduce the definition of the central local metric dimension of a graph and some properties, then construct the central local metric dimensions for trees and establish results for the grid graph.

4 July 2022 in Journal of Discrete Mathematical Sciences and Cryptography
Verified
Journal Article
Closed access
IAIka H. Agustin
Ika H. Agustin
LSLiliek Susilowati
Liliek Susilowati
DADafik
Dafik
ICIsmail N. Cangul
Ismail N. Cangul
NMN. Mohanapriya
N. Mohanapriya
A total k-labeling is defined as a function g from the edge set to the first natural number ke and a function f from the vertex set to a non-negative even number up to 2kv, where k = max{ke, 2kv}. A vertex irregular reflexive k-labeling of the graph G is total k-labeling if wt(x) ¹ wt(x¢) for every two different vertices x and x¢ of G, where wt(x) = f (x) + Σxy∈E(G) g(xy). The reflexive vertex strength of the graph G, denoted by rvs(G), is the minimum k for a graph G with a vertex irregular reflexive k-labeling. We will determine the exact value of rvs(G) in this paper, where G is a regular and regular-like graph. A regular graph is a graph where each vertex has the same number of neighbors. A regular graph with all vertices of degree r is called an r-regular graph or regular graph of degree r. A regular-like graphs is an almost regular graph that we develop in a new definition and we called it with (s, r) -almost regular graphs.

12 April 2022 in Discrete Mathematics, Algorithms and Applications
Verified
Journal Article
Closed access
PDF file
LSLiliek Susilowati
Liliek Susilowati
SISiti Istikhomah
Siti Istikhomah
MUMoh. Imam Utoyo
Moh. Imam Utoyo
SSS. Slamin
S. Slamin