Výsledky vyhledávání

Akademický článek

Analysis of Activities and Learning Outcomes Reviewed from the Learning Typology of Class VIII Students at Sultan Agung Puger Middle School in Mathematics Learning

Autor: Kiki Pangestu, Marsidi, Dimas Anditha Cahyo Sujiwo

Publikováno v: Noumerico, Vol 1, Iss 2, Pp 79-90 (2023)

Learning typology is the type of learning or appropriate method students use to facilitate the learning process so that they find it easy to receive and process information. This research describes activities and learning outcomes regarding student l

Externí odkaz: https://doaj.org/article/92527f4075e543aa8377b9ff6b11631e

Zobrazit plný text záznamu

Akademický článek

A FEMALE LEADERS IN THE PERSPECTIVE OF ISLAMIC LAW AND LEGAL REGULATIONS

Autor: Edy Sutrisno, Ahmad Fanani, Marsidi Marsidi, Adamu Abubakar Muhammad

Publikováno v: Metro Islamic Law Review, Vol 2, Iss 1, Pp 27-51 (2023)

The leader is a profession with the functions and duties of representing the government in recording and supervising marriages. Then how women become penghulu seen from Islamic law and legislation. This writing uses library research method with a qua

Externí odkaz: https://doaj.org/article/064d4a8acab3407ab1d91fa0ac30149e

Zobrazit plný text záznamu

Akademický článek

On Rainbow Vertex Antimagic Coloring of Graphs: A New Notion

Autor: Marsidi Marsidi, Ika Hesti Agustin, Dafik Dafik, Elsa Yuli Kurniawati

Publikováno v: Cauchy: Jurnal Matematika Murni dan Aplikasi, Vol 7, Iss 1, Pp 64-72 (2021)

All graph in this paper are simple, finite, and connected. Let be a labeling of a graph . The function is called antimagic rainbow edge labeling if for any two vertices and , all internal vertices in path have different weight, where the weight of ve

Externí odkaz: https://doaj.org/article/b46d3ca7833b4d9799ebe3dac5a462f2

Zobrazit plný text záznamu

Akademický článek

On the Local Adjacency Metric Dimension of Generalized Petersen Graphs

Autor: Marsidi Marsidi, Dafik Dafik, Ika Hesti Agustin, Ridho Alfarisi

Publikováno v: Cauchy: Jurnal Matematika Murni dan Aplikasi, Vol 6, Iss 1, Pp 10-17 (2019)

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 vertice

Externí odkaz: https://doaj.org/article/b774f965fc2948bc82af27145c4cdb4c

Zobrazit plný text záznamu

Akademický článek

On The Metric Dimension of Some Operation Graphs

Autor: Marsidi Marsidi, Ika Hesti Agustin, Dafik Dafik, Ridho Alfarisi, Hendrik Siswono

Publikováno v: Cauchy: Jurnal Matematika Murni dan Aplikasi, Vol 5, Iss 3, Pp 88-94 (2018)

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 di

Externí odkaz: https://doaj.org/article/aae7b530862c49ef84b829c0675ea5d7

Zobrazit plný text záznamu

Akademický článek

On The Local Metric Dimension of Line Graph of Special Graph

Autor: Marsidi Marsidi, Dafik Dafik, Ika Hesti Agustin, Ridho Alfarisi

Publikováno v: Cauchy: Jurnal Matematika Murni dan Aplikasi, Vol 4, Iss 3, Pp 125-130 (2016)

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

Externí odkaz: https://doaj.org/article/97d8d8c961614bbc9da1985f0788df3a

Zobrazit plný text záznamu