Explanipedia

On the study of Rainbow Antimagic Coloring of Special Graphs Open

Dafik Dafik, Riniatul Nur Wahidah, E R Albirri, Sharifah Kartini Said Husain · 2023

Let be a connected graph with vertex set and edge set . The bijective function is said to be a labeling of graph where is the associated weight for edge . If every edge has different weight, the function is called an edge antimagic vertex …

Bilangan Kromatik Graceful Pada Keluarga Graf Grid Open

Arika Indah Kristiana, Anzori Anzori, Robiatul Adawiyah, Slamin Slamin, E R Albirri · 2023

All graph in this paper be a connected and simple graph. Let c:V(G)→{1,2,…,k} is a proper vertex coloring where k ≥ 2 which induces a proper edge coloring c':E(G)→{1,2,…,k} define by c' (uv)=|c(u)-c(v)|, where uv in E(G) is called graceful…

On Inclusive Local Irregular Vertex Coloring of Shackle Operation Graph Open

Madila Khomsiyanti, Arika Indah Kristiana, E R Albirri · 2022

A graph is an ordered pair of two sets V and E, written . is the set of vertices and is the set of edges of the graph . The labeling of the graph is defined by where is the labeling of the vertices. The function is the vertex coloring of t…

Pewarnaan Pelangi Antiajaib pada Amalgamasi Graf Open

Riniatul Nur Wahidah, Dafik Dafik, E R Albirri · 2022

Let $G$ is a connected graph with vertex set $V(G)$ and edge set $E(G)$. The side weights for $uv\in E(G) $ bijective function $f:V(G)\rightarrow\{1,2,\dots, |V(G)|\}$ and $ w(uv)= f(u)+f(v) $ . If each edge has a different weight, the fun…

Rainbow Vertex Connection Number pada Keluarga Graf Roda Open

Firman Firman, Dafik Dafik, E R Albirri · 2022

The rainbow vertex connection was first introduced by krivelevich and yuster in 2009 which is an extension of the rainbow connection. Let graph $G =(V,E)$ is a connected graph. Rainbow vertex-connection is the assignment of color to the ve…

Pewarnaan Titik Ketakteraturan Lokal Refleksif pada Keluarga Graf Roda Open

Tommi Sanjaya Putra, Dafik Dafik, E R Albirri · 2022

All graph in this paper is simple and connected graph where $V(G)$ is vertex set and $E(G)$ is edge set. Let function $f : V(G)\longrightarrow \{0, 2,..., 2k_v\}$ as vertex labeling and a function $f: E(G)\longrightarrow \{1, 2,..., k_e\}$…

Pewarnaan Titik Ketakteraturan Lokal Inklusif pada Hasil Operasi Comb Graf Bintang Open

Arika Indah Kristiana, Surya Indriani, E R Albirri · 2022

Let G(V,E) is a simple graph and connected where V(G) is vertex set and E(G) is edge set. An inclusive local irregularity vertex coloring is defined by a mapping l:V(G) à {1,2,…, k} as vertex labeling and wi : V(G) à N is function of inclu…

Pewarnaan Titik Ketakteraturan Lokal pada Keluarga Graf Unicyclic Open

Khilyah Munawaroh, Arika Indah Kristiana, E R Albirri, Dafik Dafik, Robiatul Adawiyah · 2022

In this research is a development of local irregularity vertex coloring of graph. The based on definition, as follows: \textbf{$l:V(G) \longrightarrow {\{1, 2, ..., k}\}$} is called vertex irregular k-labelling and \textbf{$w:V(G) \longrig…

The ability to solve problem in arithmetic sequence based on the ideal problem solving in terms of the Keirsey temperament sorter and category of ability Open

Saddam Hussen, Lioni Anka Monalisa, E R Albirri, Arif Fatahillah, Nur Indah Sofia · 2022

This research is describe students' ability to solve arithmetic sequence problems based on the IDEAL problem solving stages (Identify problem, Define goal, Explore possible strategies, Anticipate outcome and act, Look back and learn) in te…

PEWARNAAN TITIK TOTAL SUPER ANTI-AJAIB LOKAL PADA GRAF PETERSEN DIPERUMUM P(n,k) DENGAN k=1,2 Open

Deddy Setyawan, Anis Nur Afni, Rafiantika Megahnia Prihandini, E R Albirri, Arika Indah Kristiana · 2021

The local antimagic total vertex labeling of graph G is a labeling that every vertices and edges label by natural number from 1 to such that every two adjacent vertices has different weights, where is The sum of a vertex label and the labe…

On graceful chromatic number of comb product of ladder graph Open

S Khoirunnisa, Dafik Dafik, Arika Indah Kristiana, Ridho Alfarisi, E R Albirri · 2021

Let G be a connected and simple graph. Proper vertex colouring c : V(G) — {1, 2, 3,…, k} where k → 2 that induces a proper edge colouring c’ : E(G) — {1, 2, 3,…, k — 1} define by c’(uv)=|c(u) — c(v)|, where uv in E(G) is called graceful k—…

Developing online interactive learning media by using easyclass with geogebra to help students representation mathematic on linear programming Open

S Hussen, Susi Setiawani, Arif Fatahillah, L A Monalisa, E R Albirri , et al. · 2021

The power of mathematical representation by applying concepts needs to be improved so that students can remember mathematical concepts sustainably. The purpose of this study to development and describe the process of interactive online med…

Eigenvalues of Adjacency and Laplacian Matrices of Bracelet—K<sub>n</sub> Graph Open

E R Albirri, Arif Fatahillah, S Hussen, Kiki Ariyanti Sugeng · 2021

Let G be an undirected simple graph. Adjacency matrix of a graph G , denoted by ( A ( G )), is defined as a matrix which has entry-( i , j ) is equal 1 if vertex i and vertex j are adjacent and 0 if otherwise. Let D ( G ) be the diagonal m…

On the irregular coloring of bipartite graph and tree graph families Open

Qurotul A’yun, Dafik Dafik, Robiatul Adawiyah, Ika Hesti Agustin, E R Albirri · 2021

This article discusses irregular coloring. Irregular coloring was first introduced by Mary Radcliffe and Ping Zhang in 2007. The coloring c is called irregular coloring if distinct vertices of G have distinct codes. The color code of a ver…

Dimensi Metrik Sisi Pada Beberapa Graf Unicyclic Open

Bayu Aprilianto, Dafik Dafik, E R Albirri · 2020

All the graphs in this paper are connected graphs and $d(e,v)$ is the length of the shortest path between $e=uv$ and $v$. Let $G=(V,E)$ where $V(G)$ is a set of vertex from graph $G$ while $E(G)$ is a set of edge from graph $G$. The edge m…

Resolving Domination Number pada Keluarga Graf Buku Open

Quthrotul Aini Fuidah, Dafik Dafik, E R Albirri · 2020

All graph in this paper are members of family of book graph. Let $G$ is a connnected graph, and let $W = \{w_1,w_2,...,w_i\}$ a set of vertices which is dominating the other vertices which are not element of $W$, and the elements of $W$ ha…

On the local multiset dimension of graph with homogenous pendant edges Open

Robiatul Adawiyah, Dafik Dafik, Ika Hesti Agustin, Rafiantika Megahnia Prihandini, Ridho Alfarisi , et al. · 2020

Let G be a connected graph with E as edge set and V as vertex set. r m ( v | W ) = { d ( v , s 1 ), d ( v, s 2 ),…, d ( v, s k )} is the multiset representation of a vertex v of G with respect to W where d ( v , s i ) is a distance between…

On the local (adjacency) metric dimension of split related wheel graphs Open

E R Albirri, Dafik Dafik, Ika Hesti Agustin, Robiatul Adawiyah, Ridho Alfarisi , et al. · 2020

Let G be a simple and connected graph. When G graph is added by new vertex v ’ in graph G (where the number of vertex v ’ corresponds to vertex v ) such that if v 1 adjacent to v 2 in G then v 1 will adjacent to v 2 in G . The G graph is c…

On rainbow antimagic coloring of some special graph Open

Z L Al Jabbar, Dafik Dafik, Robiatul Adawiyah, E R Albirri, Ika Hesti Agustin · 2020

Let G = ( V, E ) be a connected and simple graphs with vertex set V and edge set E . A coloring of graph G is rainbow connected if there is a rainbow path that connects each two vertices of graph G . The minimum k such that G has a rainbow…

On resolving domination number of friendship graph and its operation Open

S Kurniawati, Slamin Slamin, Dafik Dafik, D A R Wardani, E R Albirri · 2020

Let G = ( V, E ) be a simple, finite, and connected graph of order n . A dominating set D ⊆ V ( G ) such every vertex not in D is adjacent to at least one member of D . A dominating set of smallest size is called a minimum dominating set a…

Graceful Chromatic Number of Unicyclic Graphs Open

Ridho Alfarisi, Dafik Dafik, Rafiantika Megahnia Prihandini, Robiatul Adawiyah, E R Albirri , et al. · 2019

We consider that all graph in this paper are finite, simple and connected graph. A graceful k−coloring of a graph is a proper vertex coloring f : V(G) → {1, 2, ..., k}, where k ≥ 2 which induces a proper edge coloring f' : E(G) → {1, 2, ..…

Mathematical Literacy of Male and Female Students in Solving PISA Problem by “Shape and Space” Content Open

Dinawati Trapsilasiwi, Ervin Oktavianingtyas, I W S Putri, Robiatul Adawiyah, E R Albirri , et al. · 2019

This is a descriptive research which aims to describe mathematical literacy of male and female students by solving PISA problem. Mathematical problems are not only related to calculations, but how our ability to apply mathematical knowledg…

The local multiset dimension of unicyclic graph Open

Robiatul Adawiyah, Dafik Dafik, Rafiantika Megahnia Prihandini, E R Albirri, Ika Hesti Agustin , et al. · 2019

An unicyclic graph is a graph which contains exactly one cycle. For k–ordered set W = {s1, s2, . . ., sk} of vertex set G, the multiset representation of a vertex v of G with respect to W is rm(v|W ) = {d(v, s1), d(v, s2), . . ., d(v, sk)}…

On the local adjacency metric dimension of split graph Open

E R Albirri, Dafik Dafik, Ika Hesti Agustin, Ridho Alfarisi, Rafiantika Megahnia Prihandini , et al. · 2019

The metric dimension is one of an interesting studied graph topics. The local adjacency metric dimension is combination of the local metric dimension and the adjacency metric dimension. The graph G = (V, E) in this study is connected, simp…

How do indonesian sixth grader students make sense of directproportion: a closer look at student with mathematics anxiety Open

Reza Ambarwati, Lela Nur Safrida, E R Albirri, Robiatul Adawiyah, Akhlisa Ainun Nizar · 2019

This study aims to explore how Indonesian students make sense direct proportion concepts according to their level of mathematics anxiety. This research tried to uncover the meaning of a phenomenon for students who are involved. In represen…

The total edge product cordial labeling of graph with pendant vertex Open

Rafiantika Megahnia Prihandini, Ika Hesti Agustin, Dafik Dafik, E R Albirri, Robiatul Adawiyah , et al. · 2019

One of the topics in graph theory is labeling. The object of the study is a graph generally represented by vertex, edge and sets of natural numbers called label. For a graph G, the function of vertex labeling g : V(G) → {0, 1} induces an e…

Super domination number of unicyclic graphs Open

Ridho Alfarisi, Dafik Dafik, Robiatul Adawiyah, Rafiantika Megahnia Prihandini, E R Albirri , et al. · 2019

All graphs in this paper are a connected graph, denoted by G = (V, E).The open neighbourhood of a vertex v of a graph G is the set N(v) consisting of all vertices adjacent to v in G. For D ⊂ V(G), we define D = V(G)\D, a set D ⊂ V(G) is ca…

The local (adjacency) metric dimension of split related complete graph Open

E R Albirri, Dafik Dafik, Ika Hesti Agustin, Robiatul Adawiyah, Ridho Alfarisi , et al. · 2019

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 with y then . A mini…

On the local multiset dimension of<i>m</i>-shadow graph Open

Robiatul Adawiyah, Dafik Dafik, Ika Hesti Agustin, Rafiantika Megahnia Prihandini, Ridho Alfarisi , et al. · 2019

Let G = (V, E) be a simple and connected graph with edge set E and vertex set V . Suppose W = {s1, s2, ..., sk} is a subset of vertex set V (G), the representation multiset of a vertex v of G with respect to W is where d(v, si) is a distan…

On the partition dimension of edge corona product of path and cycle Open

Ridho Alfarisi, Dafik Dafik, Robiatul Adawiyah, Rafiantika Megahnia Prihandini, E R Albirri , et al. · 2019

Let v be a vertex of a connected graph G(V, E). Let S be a subset of V (G). For an ordered partition of V (G), the representation of a vertex with respect to is the k-vectors , where d(v, Sk) represents the distance between the vertex v an…

E R Albirri YOU? Author Swipe