Claim Missing Document
Check
Articles

Found 2 Documents
Search
Journal : Indonesian Journal of Combinatorics

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.
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.
Co-Authors ADE NGESTU SULISTIO Admi Nazra Afdhal Muttaqin Afifah Dwi Putri Ahmad Surya Aidilla Darmawahyuni Al Azizu, Khairannisa ALEX MARDIANA ANGGUN DELVIANA Anggun Saputri Zain Arrival Rince Putri Asdi, Yudiantri ASEP TRI SAPUTRA Asmanelita Faizasari Aulia Radesa Bahri, Susila Baqi, Ahmad Iqbal Baqi, Ahmad Iqbal Budi Rudianto Bukti Ginting Chintia Deva Rianti Citra Mayora Claudia Putri Zoelanda DEBI ZULKARNAIN Delvitri Murni Des Welyyanti Devianto, Dodi EFENDI . Efendi Efendi Efendi Efendi Efendi Efendi Effendi Effendi Effendi Effendi Elvathna Syafwan Faizah . Fauzana Hilma Fifi Febrianti Fuji Astuti Febria Ghazy Muhari Novrial Hamdi, Syukri Hary Wahyudi Hazmira Yozza Helcy Yuhanna Helmi, Monika Rianti Herliani Evinda Ikhlas Pratama Sandi Ilham, Muhammad Samudra Imelda Roza Iqbal Sanjaya Ivo Muthia Izzati Rahmi HG Izzati Rahmi HG Khairannisa Al Azizu Laksmi Charina Thasya Mairawita, Mairawita Maiyastri, Maiyastri Mawanda Almuhayar MELATI NUR Mery Anggraini Mildawati Mildawati Mira Adriani Monika, Indah Muhafzan Muhafzan Muthia Muhana Nadia Nadia Nailul Yuni Permataputri Nelli Hindriani Nelsa Andriana Nova Noliza Bakar Nurwijayanti Putri Wahyu Aisyah Putri Wulan Sari Radhiatul Husna Rendy Aditya Pratama Rifqi Riyandho Riri Lestari RIZKI REFORMAN Rosita, Silvia RUVIQA PUTRI SOLEHA Salsabila, Unik Hanifah Sandi Wanda Harlan Shelli Fitrianda Solfiyeni Solfiyeni Solly Aryza Sri Ayu Ningsih Sri Hariyani SUCI ANISA SYUHADA Suci Rahma Putri Sutra Lidya Pritama Sutra Melcy Selvia Syafrizal Sy Syafrizal Syafrizal Syafwan, Mahdhivan Syafwan, Mahdivan Syukri Hamdi Wellyanti , Des Yanita Yanita Yanuar, Ferra Yefrida - Yosi Putri YOZA DELLA SYAUMI Yulianti, Lyra Zulakmal, Zulakmal Zulfi, Zulfi