Browsing LSP-Jurnal Ilmiah Dosen by Author "ALFARISI, Ridho"

Now showing items 1-20 of 25

    • The 2-Distance Chromatic Number of Some Wheel Related Graphs 

      KRISTIANA, Arika Indah; UTOYO, Muhammad Imam; DAFIK, Dafik; ALFARISI, Ridho (Far East Journal of Mathematical Sciences (FJMS), Volume 103, Number 3, 2018, Pages 645-657, 2018-02-09)
      Let ( )EVG , be a simple and connected graph of vertex set V and edge set E. By the 2-distance chromatic number of a graph G, we mean a map ( ) { }k c GV ,1 ,2 ,3 ..., : → such that any two vertices ...

    • Analisis Pengaruh Evaluasi Pembelajaran Secara Virtual Menggunakan Quizzes Terhadap Hasil Belajar Siswa 

      ADAWIYAH, Robiatul; PRIHANDINI, Rafiantika M.; ALFARISI, Ridho (Jurnal Ilmu Pendidikan Sekolah Dasar, 2022-06)
      Pandemi Covid-19 telah mengubah pola pembelajaran secara masif. Proses pembelajaran yang mestinya dilaksanakan secara tatap muka sekarang berubah menjadi sistem pembelajaran jarak jauh atau daring. Penggunaan ...

    • The Effectiveness of Research-Based Learning With Computer Programming and Highly Interactive Cloud Classroom (Hic) Elaboration in Improving Higher Order Thinking Skills in Solving a Combination of Wave Functions 

      RIDLO, Zainur Rasyid; DAFIK, Dafik; PRIHANDINI, Rafiantika Megahnia; C I W NUGROHO, C I W Nugroho; ALFARISI, Ridho (IOP Conf. Series: Journal of Physics, 2019-05-07)
      The aim of this research was to compare the HIC (Highly interactive classroom) system with a traditional method of teaching superposition of wave functions courses especially. In order to examine it’s learning effectiveness ...

    • Elegant Labeling Of Some Graphs 

      PRIHANDINI, Rafiantika Megahnia; DAFIK, Dafik; ADAWIYAH, Robiatul; ALFARISI, Ridho; AGUSTIN, Ika Hesti; M VENKATACHALAM, M Venkatachalam (Journal of Physics: Conference Series, 2020-12-01)
      In this paper, we introduce a new notion of graph theory study, namely a local edge metric dimension. It is a natural extension of metric dimension concept. dG(e, v) = min{d(x, v), d(y, v)} is the distance between the ...

    • Elegant Labeling of Some Graphs 

      PRIHANDINI, Rafiantika Megahnia; DAFIK, Dafik; AGUSTIN, Ika Hesti; ALFARISI, Ridho; ADAWIYAH, Robiatul (Journal of Physics: Conference Series, 2020-06-19)
      An elegant labeling on graph G with vertices and edges is an injective (one-to-one) mapping from the set of vertices V (G) to the set of non-negative integers f0; 1; 2; 3; :::; g in such a way that the set of values ...

    • An Inclusive Local Irregularity Coloring of Graphs 

      KRISTIANA, Arika Indah; DAFIK, Dafik; ALFARISI, Ridho; ANWAR, Umi Azizah; CITRA, Sri Moeliyana (Advances in Mathematics: Scientific Journal, 2020)
      All graph in this paper are connected and simple. Let G = (V, E) be a simple graph, where V (G) is vertex set and E(G) is edge set. The local irregularity vertex coloring of G is l : V (G) → {1, 2, · · · , k} and w : V (G) ...

    • The Local (Adjacency) Metric Dimension of Split Related Complete Graph 

      ADAWIYAH, Robiatul; DAFIK, Dafik; PRIHANDINI, Rafiantika Megahnia; ALBIRRI, Ermita Rizki; AGUSTIN, Ika Hesti; ALFARISI, Ridho (IOP Conf. Series: Journal of Physics: Conf. Series, 2019-04-01)
      Let G be a simple graph. A set of vertices, called V (G) and a set of edges, called E(G) are two sets which form graph G. W is a local adjacency resolving set of G if for every two distinct vertices x, y and x adjacent ...

    • Local Antimagic r-dynamic Coloring of Graphs 

      KRISTIANA, Arika Indah; UTOYO, Muhammad Imam; DAFIK, Dafik; AGUSTIN, Ika Hesti; ALFARISI, Ridho (IOP Conf. Series: Earth and Environmental Science 243 (2019) 012077, 2019-04-09)
      Let G = (V; E) be a connected graph. A bijection function f : E(G) ! f1; 2; 3; ; E(G)jg is called a local antimagic labeling if for all uv 2 E(G)s, w(u) 6= w(v), where w(u) = e2E(u)f(e). Such that, local antimagic ...

    • Local Distance Irregular Labeling of Graphs 

      KRISTIANA, Arika Indah; KRISTIANA, Arika Indah; ALFARISI, Ridho; DAFIK, Dafik (TWMS Journal of Applied and Engineering Mathematics, 2023)
      We introduce the notion of distance irregular labeling, called the local distance ir regular labeling. We define λ : V (G) −→ {1, 2, . . . , k} such that the weight calculated at the vertices induces a vertex coloring if ...

    • Local Irregular Vertex Coloring of Some Families Graph 

      KRISTIANA, Arika Indah; ALFARISI, Ridho; DAFIK, Dafik; AZAHRA, Nadia (Journal of Discrete Mathematical Sciences and Cryptography, (DOI : 10.1080/09720529.2020.1754541), 2020-06-09)
      All graph in this paper is connected and simple graph. Let d(u, v) be a distance between any vertex u and v in graph G = (V, E ). A function : ( ) l V G {1, 2, , } k →  is called vertex irregular k-labelling ...

    • Local Irregularity Vertex Coloring of Graphs 

      KRISTIANA, Arika Indah; UTOYO, Muhammad Imam; SLAMIN, Slamin; ALFARISI, Ridho; AGUSTIN, Ika Hesti; M. Venkatachalam (nternational Journal of Civil Engineering and Technology (IJCIET) Volume 10, Issue 03, March 2019, pp. 1606–1616, 2019-03-03)
      In this paper we study a new notion of coloring type of graph, namely a local irregularity vertex coloring. We define is called vertex irregular -labeling and where . By a ...

    • Metric Chromatic Number of Unicyclic Graphs 

      ALFARISI, Ridho; KRISTIANA, Arika Indah; ALBIRRI, Ermita Rizki; ADAWIYAH, Robiatul; DAFIK, Dafik (INTERNATIONAL JOURNAL OF SCIENTIFIC & TECHNOLOGY RESEARCH VOLUME 8, ISSUE 06, JUNE 2019, 2019-06-09)
      All graphs in this paper are nontrivial and connected graph. Let 𝑓 ∶ 𝑉 (𝐺) → *1,2, … , 𝑘+ be a vertex coloring of a graph 𝐺where two adjacent vertices may be colored the same color. Consider the color classes Π = ...

    • On H-Supermagic Labelings of m-Shadow of Paths and Cycles 

      AGUSTIN, Ika Hesti; SUSANTO, Faisal; DAFIK; PRIHANDINI, Rafiantika Megahnia; ALFARISI, Ridho; I. W. Sudarsana (2019-03-04)
      The labeling f is called super if the smallest possible labels appear on the vertices. A graph that admits (super) (a,d)-H-antimagic total labeling is called (super) (a,d)-H-antimagic.

    • On Local Irregularity of the Vertex Coloring of the Corona Product of a Tree Graph 

      KRISTIANA, Arika Indah; HIDAYAT, M.; ADAWIYAH, Robiatul; DAFIK, Dafik; SETIAWANI, Susi; ALFARISI, Ridho (Jurnal Bioindustri, 2022)
      Let G = (V, E) be a graph with a vertex set V and an edge set E. The graph G is said to be with a local irregular vertex coloring if there is a function f called a local irregularity vertex coloring with the properties: ...

    • On the Chromatic Number Local Irregularity of Related Wheel Graph 

      KRISTIANA, Arika Indah; UTOYO, Muhammad Imam; DAFIK, Dafik; AGUSTIN, Ika Hesti; ALFARISI, Ridho; WALUYO, Eko (IOP Conf. Series: Journal of Physics: Conf. Series 1211 (2019) 012003, 2019-05-07)
      A function f is called a local irregularity vertex coloring if (i) l : V (G) ! f1; 2; ; kg as vertex irregular k-labeling and w : V (G) ! N, for every uv 2 E(G); w(u) 6= w(v) where w(u) = v2N(u)l(v) and (ii) ...

    • On the Local Irregularity Vertex Coloring of Related Grid Graph 

      AZAHRA, Nadia; KRISTIANA, Arika Indah; DAFIK, Dafik; ALFARISI, Ridho (International Journal of Academic and Applied Research (IJAAR), Vol. 4 Issue 2, February – 2020, Pages: 1-4, 2020-02-01)
      All graph in this paper is connected and simple graph. Let graph d(u,v) be a distance between any vertex u and v in graph ( ). A functio ( ) * +n is called vertex irregular k-labelling and ( ) where ...

    • On the local irregularity vertex coloring of volcano, broom, parachute, double broom and complete multipartite graphs 

      KRISTIANA, Arika Indah; NIKMAH, Nafidatun; DAFIK, Dafik; ALFARISI, Ridho; HASAN, M. Ali; SLAMIN, Slamin (World Scientific Publishing Company, 2021-09-05)
      Let G = (V,E) be a simple, finite, undirected, and connected graph with vertex set V (G) and edge set E(G). A bijection l : V (G) → {1, 2,...,k} is label function l if opt(l) = min{max(li) : li vertex irregular labeling} ...

    • On the Local Multiset Dimension of Graph With Homogenous Pendant Edges 

      ADAWIYAH, Robiatul; DAFIK, Dafik; AGUSTIN, Ika Hesti; PRIHANDINI, Rafiantika Megahnia; ALFARISI, Ridho; ALBIRRI, Ermita Rizki (Journal of Physics: Conference Series, 2019-12-01)
      Let G be a connected graph with E as edge set and V as vertex set . rm(v|W) = {d(v, s1), d(v, s2), . . . , d(v, sk)} is the multiset representation of a vertex v of G with respect to W where d(v, si) is a distance between ...

    • On The Packing k-Coloring of Edge Corona Product 

      JOEDO, Jean Claudia; KRISTIANA, Arika Indah; DAFIK, Dafik; ALFARISI, Ridho (International Journal of Academic and Applied Research (IJAAR), Vol. 3 Issue 12, December – 2019, Pages: 55-59, 2019-12-01)
      All graph in this paper is connected and simple graph. Let du,v be a distance between any vertex u and v in graph G  V,E . A function c :VG1, 2,, k is called a packing k-coloring if every two vertices ...

    • On the r-Dynamic Chromatic Numberof Corona Product of Star Graph 

      KRISTIANA, Arika Indah; UTOYO, Mohammad Imam; DAFIK, Dafik; ALFARISI, Ridho; WALUYO, Eko (Thai Journal of Mathematics, 2022-10-01)
      A proper k coloring of graph G such that the neighbors of any vertex v ∈ V (G) where at least min{r, d(v)} different colors is defined an r-dynamic coloring. The minimum k such that graph G has an r-dynamic k coloring is ...