Article Per Year (5 Year)
p-Index From 2021 - 2026
4.426
P-Index
This Author published in this journals
All Journal Science and Technology Indonesia JMPM: Jurnal Matematika dan Pendidikan Matematika BAREKENG: Jurnal Ilmu Matematika dan Terapan Jambura Journal of Mathematics Jurnal Hilirisasi IPTEKS (JHI) Eksakta : Berkala Ilmiah Bidang MIPA Indonesian Journal of Combinatorics Jurnal Matematika UNAND Jurnal Lebesgue : Jurnal Ilmiah Pendidikan Matematika, Matematika dan Statistika Jurnal Natural Limits: Journal of Mathematics and Its Applications
Yulianti, Lyra
Department Of Mathematics And Data Science, Faculty Of Mathematics And Natural Sciences, Universitas Andalas, Indonesia
Agriculture, Biological Sciences & Forestry Astronomy Biochemistry, Genetics & Molecular Biology Chemical Engineering, Chemistry & Bioengineering Chemistry Civil Engineering, Building, Construction & Architecture Computer Science & IT Control & Systems Engineering Decision Sciences, Operations Research & Management Dentistry Earth & Planetary Sciences Economics, Econometrics & Finance Education Energy Engineering Environmental Science Health Professions Immunology & microbiology Materials Science & Nanotechnology Mathematics Mechanical Engineering Neuroscience Physics Public Health Transportation Veterinary Other

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

Found 5 Documents
Search
Journal : Indonesian Journal of Combinatorics

 1 
On the Locating Chromatic Number of Barbell Shadow Path Graph A. Asmiati; Maharani Damayanti; Lyra Yulianti
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.4

Abstract

The locating-chromatic number was introduced by Chartrand in 2002. The locating chromatic number of a graph is a combined concept between the coloring and partition dimension of a graph. The locating chromatic number of a graph is defined as the cardinality of the minimum color classes of the graph. In this paper, we discuss about the locating-chromatic number of shadow path graph and barbell graph containing shadow graph.
On the subdivided thorn graph and its metric dimension Lyra Yulianti; Narwen Narwen; Sri Hariyani
Indonesian Journal of Combinatorics Vol 3, No 1 (2019)
Publisher : Indonesian Combinatorial Society (InaCombS)

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (236.79 KB) | DOI: 10.19184/ijc.2019.3.1.4

Abstract

For some ordered subset W = {w1, w2, ⋯, wt} of vertices in connected graph G, and for some vertex v in G, the metric representation of v with respect to W is defined as the t-vector r(v∣W) = {d(v, w1), d(v, w2), ⋯, d(v, wt)}. The set W is the resolving set of G if for every two vertices u, v in G, r(u∣W) ≠ r(v∣W). The metric dimension of G, denoted by dim(G), is defined as the minimum cardinality of W. Let G be a connected graph on n vertices. The thorn graph of G, denoted by Th(G, l1, l2, ⋯, ln), is constructed from G by adding li leaves to vertex vi of G, for li ≥ 1 and 1 ≤ i ≤ n. The subdivided-thorn graph, denoted by TD(G, l1(y1), l2(y2), ⋯, ln(yn)), is constructed by subdividing every li leaves of the thorn graph of G into a path on yi vertices. In this paper the metric dimension of thorn of complete graph, dim(Th(Kn, l1, l2, ⋯, ln)), li ≥ 1 are determined, partially answering the problem proposed by Iswadi et al . This paper also gives some conjectures for the lower bound of dim(Th(G, l1, l2, ⋯, ln)), for arbitrary connected graph G. Next, the metric dimension of subdivided-thorn of complete graph, dim(TD(Kn, l1(y1), l2(y2), ⋯, ln(yn)) are determined and some conjectures for the lower bound of dim(Th(G, l1(y1), l2(y2), ⋯, ln(yn)) for arbitrary connected graph G are given.
Further Results on Locating Chromatic Number for Amalgamation of Stars Linking by One Path A. Asmiati; Lyra Yulianti; C. Ike Tri Widyastuti
Indonesian Journal of Combinatorics Vol 2, No 1 (2018)
Publisher : Indonesian Combinatorial Society (InaCombS)

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (222.469 KB) | DOI: 10.19184/ijc.2018.2.1.6

Abstract

Let G = (V, E) be a connected graph. Let c be a proper coloring using k colors, namely 1, 2, ⋯, k. Let Π = {S1, S2, ⋯, Sk} be a partition of V(G) induced by c and let Si be the color class that receives the color i. The color code, cΠ(v) = (d(v, S1), d(v, S2), ⋯, d(v, Sk)), where d(v, Si) = min{d(v, x)∣x ∈ Si} for i ∈ [1, k]. If all vertices in V(G) have different color codes, then c is called as the locating-chromatic k-coloring of G. Minimum k such that G has the locating-chromatic k-coloring is called the locating-chromatic number, denoted by χL(G). In this paper, we discuss the locating-chromatic number for n certain amalgamation of stars linking a path, denoted by nSk, m, for n ≥ 1, m ≥ 2, k ≥ 3, and k > m.
On Super (a,d)-edge antimagic total labeling of branched-prism graph Khairannisa Al Azizu; Lyra Yulianti; Narwen Narwen; Syafrizal Sy
Indonesian Journal of Combinatorics Vol 5, No 1 (2021)
Publisher : Indonesian Combinatorial Society (InaCombS)

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

Abstract

Let H be a branched-prism graph, denoted by H = (Cm x P2) ⊙ Ǩn for odd m, m ≥ 3 and n ≥ 1. This paper considers about the existence of the super (a,d)-edge antimagic total labeling of H, for some positive integer a and some non-negative integer d.
On Ramsey (mK2,bPn)-minimal Graphs Nadia Nadia; Lyra Yulianti; Fawwaz Fakhrurrozi Hadiputra
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.2

Abstract

Let G and H be two given graphs. The notation F→(G,H) means that any red-blue coloring on the edges of F will create either a red subgraph G or a blue subgraph H in F. A graph F is a Ramsey (G,H)-minimal graph if F satisfies two conditions: (1) F→(G,H), and (2) (F−e) ⇸ (G,H) for every e ∈ E(F). Denote ℜ(G,H) as the set of all (G,H)-minimal graphs. In this paper we prove that a tree T is not in ℜ(mK2,bPn) if it has a diameter of at least n(b+m−1)−1 for m,n,b≥2, furthermore we show that (b+m−1)Pn ∈ ℜ(mK2,bPn) for every m,n,b≥2. We also prove that for n≥3, a cycle on k vertices is in ℜ(mK2,bPn) if and only if k ∈ [n(b+m−2)+1, n(b+m−1)−1].
Co-Authors A. Asmiati Abdi Musra Abel, Latifa Azhar ADE NGESTU SULISTIO ADEK HAYATI PUTRI Admi Nazra Aisyah Nurinsani Alifaziz Arsyad Alsbaldo, Yuco Angdini Putri F Angryanof, Uthary Putri Auli Mardhaningsih C. Ike Tri Widyastuti Daramenra, Romie DEBI ZULKARNAIN Des Welyyanti Effendi Effendi Effendi Effendi Eka Purwanti Elva Rahimah Fadillah Fadillah Fajri, Muhammad Rafif Fakhri Zikra Fawwaz Fakhrurrozi Hadiputra Fifi Febrianti Fitri - Anggalia Haves Derindo Hazmira Yozza Hidayati Rais Izzati Rahmi HG Kelson Novrianus Lessya Khairannisa Al Azizu KIKI KHAIRA MARDIMAR Laila Hidayati Lessya, Kelson Novrianus M Fauzan Hardi Maharani Damayanti Mardhaningsih, Auli Mardhaningsih, Auli Mardimar, Kiki Khaira Maya Nabila mellany mellany Mellany, Mellany Muhammad Rafif Fajri MUHAMMAD RANDA Muhardiansyah Muhardiansyah Mutiara Ramadhani Syafnur Nada Andriani Nadia Nadia Nadia Nadia Nailul Yuni Permataputri Narwen Narwen NINDI MAULA AZIZAH Nurhasanah Nurhasanah Nurinsani, Aisyah Permana, Dony Putri Wulan Sari Risya Hazani Utari RIZKI REFORMAN Robi Nugraha Sayi Romie Daramenra Shelli Fitrianda Siska - Zayendra Sri Hariyani Suci Yefri Fadillah Suciana Budi Aryani SUTANTO, DASA Syafrizal Sy Syafrizal Sy Syafrizal Sy . Syafwan, Mahdhivan Tika Apriliza ULFA RAHAYU SY Yanita Yanita YANITA YANITA, YANITA Zayendra, Siska - Zayendra, Siska - Zulakmal, Zulakmal ZULKARNAIN, DEBI