Ridho Alfarisi, Ridho
Unknown Affiliation

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

Found 6 Documents
Search

Analisa Himpunan Dominasi pada Graf-Graf Khusus Fatahillah, Arif; Dafik, Dafik; Alfarisi, Ridho
Prosiding Seminar Matematika dan Pendidikan Matematik Vol 1, No 1 (2014): Prosiding Seminar Nasional Matematika 2014
Publisher : Prosiding Seminar Matematika dan Pendidikan Matematik

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

The advance of science and technology increases proportionally to the development of era. Today era tends to the raise to the advance of ICT. One research interest which supports the ICT development is a graph theory. A dominating set theory is one of a graph theory which has a wide range of applications mainly in communication network and space syntax theory. A set $D$ of vertices of a simple graph $G$, that is a graph without loops and multiple edges, is called a dominating set if every vertex $uin V(G)-D$ is adjacent to some vertex $vin D$. The domination number of a graph $G$, denoted by $gamma_{k}{G}$; $kin{{1,2}}$, is the order of a smallest dominating set of $G$. This research aims to find the domination number of some families of special graphs, disc brake graph $Db_{n,m}$, lampion graph $pounds_{n,m}$, prism graph $D_{n,m}$, and staked ladder graph $Dt_{n,m}$.
On The Local Metric Dimension of Line Graph of Special Graph Marsidi, Marsidi; Dafik, Dafik; Hesti Agustin, Ika; Alfarisi, Ridho
CAUCHY Vol 4, No 3 (2016): CAUCHY
Publisher : Mathematics Department, Maulana Malik Ibrahim State Islamic University of Malang

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (917.503 KB) | DOI: 10.18860/ca.v4i3.3694

Abstract

Let G be a simple, nontrivial, and connected graph.  is a representation of an ordered set of k distinct vertices in a nontrivial connected graph G. The metric code of a vertex v, where , the ordered  of k-vector is representations of v with respect to W, where  is the distance between the vertices v and wi for 1≤ i ≤k.  Furthermore, the set W is called a local resolving set of G if  for every pair u,v of adjacent vertices of G. The local metric dimension ldim(G) is minimum cardinality of W. The local metric dimension exists for every nontrivial connected graph G. In this paper, we study the local metric dimension of line graph of special graphs , namely path, cycle, generalized star, and wheel. The line graph L(G) of a graph G has a vertex for each edge of G, and two vertices in L(G) are adjacent if and only if the corresponding edges in G have a vertex in common.
On The Metric Dimension of Some Operation Graphs Marsidi, Marsidi; Agustin, Ika Hesti; Dafik, Dafik; Alfarisi, Ridho; Siswono, Hendrik
CAUCHY Vol 5, No 3 (2018): CAUCHY
Publisher : Mathematics Department, Maulana Malik Ibrahim State Islamic University of Malang

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (782.001 KB) | DOI: 10.18860/ca.v5i3.5331

Abstract

Let  be a simple, finite, and connected graph. An ordered set of vertices of a nontrivial connected graph  is  and the -vector  represent vertex  that respect to , where  and  is the distance between vertex  and  for . The set  called a resolving set for  if different vertex of  have different representations that respect to . The minimum of cardinality of resolving set of G is the metric dimension of , denoted by . In this paper, we give the local metric dimension of some operation graphs such as joint graph , amalgamation of parachute, amalgamation of fan, and .
On The Local Edge Antimagic Coloring of Corona Product of Path and Cycle Aisyah, Siti; Alfarisi, Ridho; Prihandini, Rafiantika M.; Kristiana, Arika Indah; Christyanti, Ratna Dwi
CAUCHY Vol 6, No 1 (2019): CAUCHY: Jurnal Matematika Murni dan Aplikasi
Publisher : Mathematics Department, Maulana Malik Ibrahim State Islamic University of Malang

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (716.577 KB) | DOI: 10.18860/ca.v6i1.8054

Abstract

Let  be a nontrivial and connected graph of vertex set  and edge set  . A bijection  is called a local edge antimagic labeling if for any two adjacent edges  and , where for . Thus, the local edge antimagic labeling induces a proper edge coloring of G if each edge e assigned the color  . The color of each an edge e = uv is assigned bywhich is defined by the sum of label both and vertices  and  . The local edge antimagic chromatic number, denoted by  is the minimum number of colors taken over all colorings induced by local edge antimagic labeling of   . In our paper, we present the local edge antimagic coloring of corona product of path and cycle, namely path corona cycle, cycle corona path, path corona path, cycle corona cycle.Keywords: Local antimagic; edge coloring; corona product; path; cycle.
On the Local Adjacency Metric Dimension of Generalized Petersen Graphs Marsidi, Marsidi; Dafik, Dafik; Agustin, Ika Hesti; Alfarisi, Ridho
CAUCHY Vol 6, No 1 (2019): CAUCHY: Jurnal Matematika Murni dan Aplikasi
Publisher : Mathematics Department, Maulana Malik Ibrahim State Islamic University of Malang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.18860/ca.v6i1.6487

Abstract

The local adjacency metric dimension is one of graph topic. Suppose there are three neighboring vertex , ,  in path . Path  is called local if  where each has representation: a is not equals  and  may equals to . Let’s say, .  For an order set of vertices , the adjacency representation of  with respect to  is the ordered -tuple , where  represents the adjacency distance . The distance  defined by 0 if , 1 if  adjacent with , and 2 if  does not adjacent with . The set  is a local adjacency resolving set of  if for every two distinct vertices ,  and  adjacent with y then . A minimum local adjacency resolving set in  is called local adjacency metric basis. The cardinality of vertices in the basis is a local adjacency metric dimension of , denoted by . Next, we investigate the local adjacency metric dimension of generalized petersen graph.
Analisa Himpunan Dominasi pada Graf-Graf Khusus Alfarisi, Ridho; Dafik, Dafik; Fatahillah, Arif
Prosiding Seminar Matematika dan Pendidikan Matematik Vol 1 No 5 (2014): Prosiding Seminar Nasional Matematika 2014
Publisher : Prosiding Seminar Matematika dan Pendidikan Matematik

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

The advance of science and technology increases proportionally to the development of era. Today era tends to the raise to the advance of ICT. One research interest which supports the ICT development is a graph theory. A dominating set theory is one of a graph theory which has a wide range of applications mainly in communication network and space syntax theory. A set $D$ of vertices of a simple graph $G$, that is a graph without loops and multiple edges, is called a dominating set if every vertex $u\in V(G)-D$ is adjacent to some vertex $v\in D$. The domination number of a graph $G$, denoted by $\gamma_{k}{G}$; $k\in{\{1,2\}}$, is the order of a smallest dominating set of $G$. This research aims to find the domination number of some families of special graphs, disc brake graph $Db_{n,m}$, lampion graph $\pounds_{n,m}$, prism graph $D_{n,m}$, and staked ladder graph $Dt_{n,m}$.