Proceedings of the International Conference on Mathematics, Geometry, Statistics, and Computation (IC-MaGeStiC 2021)

+ Advanced search
45 articles
Proceedings Article

On Ramsey Minimal Graphs for a 3-Matching Versus a Path on Five Vertices

Kristiana Wijaya, Edy Tri Baskoro, Asep Iqbal Taufik, Denny Riama Silaban
Let G, H, and F be simple graphs. The notation F ⟶ (G, H) means that any red-blue coloring of all edges of F contains a red copy of G or a blue copy of H. The graph F satisfying this property is called a Ramsey (G, H)-graph. A Ramsey (G, H)-graph is called minimal if for each edge e ∈ E(F), there exists...
Proceedings Article

Ramsey Graphs for a Star on Three Vertices Versus a Cycle

Maya Nabila, Edy Tri Baskoro, Hilda Assiyatun
Let G, A, and B be simple graphs. The notation G → (A, B) means that for any red-blue coloring of the edges of G, there is a red copy of A or a blue copy of B in G. A graph G is called a Ramsey graph for (A, B) if G → (A, B). Additionally, if the graph G satisfies that G − e ↛ (A, B), for any e ∈ E(G),...
Proceedings Article

On Ramsey (mK2, P4)-Minimal Graphs

Asep Iqbal Taufik, Denny Riama Silaban, Kristiana Wijaya
Let F, G, and H be simple graphs. The notation F → (G, H) means that any red-blue coloring of all edges of F will contain either a red copy of G or a blue copy of H. Graph F is a Ramsey (G, H)-minimal if F → (G, H) but for each 𝑒 ∈ E(F), (𝐹 − 𝑒) ↛ (G, H). The set ℛ(G, H) consists of all Ramsey (G,...
Proceedings Article

Spectrum of Unicyclic Graph

Budi Rahadjeng, Dwi Nur Yunianti, Raden Sulaiman, Agung Lukito
Let G be a simple graph with n vertices and let A(G) be the (0, 1)-adjacency matrix of G. The characteristic polynomial of the graph G with respect to the adjacency matrix A(G), denoted by χ(G, λ) is a determinant of (λI − A(G)), where I is the identity matrix. Suppose that λ1 ≥ λ2 ≥ ⋯ ≥ λn are the adjacency...
Proceedings Article

Distinguishing Number of the Generalized Theta Graph

Andi Pujo Rahadi, Edy Tri Baskoro, Suhadi Wido Saputro
A generalized theta graph is a graph constructed from two distinct vertices by joining them with l (>=3) internally disjoint paths of lengths greater than one. The distinguishing number D(G) of a graph G is the least integer d such that G has a vertex labelling with d labels that is preserved only...
Proceedings Article

Edge Magic Total Labeling of (n, t)-Kites

Inne Singgih
An edge magic total (EMT) labeling of a graph G = (V, E) is a bijection from the set of vertices and edges to a set of numbers defined by λ: V ∪ E → {1,2, …, |V| + |E|} with the property that for every xy ∈ E, the weight of xy equals to a constant k, that is, λ(x) + λ(y) + λ(xy) = k for some integer...
Proceedings Article

Further Result of H-Supermagic Labeling for Comb Product of Graphs

Ganesha Lapenangga P., Aryanto, Meksianis Z. Ndii
Let G = (V, E) and H = (V′, E′) be a connected graph. H-magic labeling of graph G is a bijective function f: V(G) ∪ E(G) → {1,2, …, |V(G)| + |E(G)|} such that for every subgraph H′of G isomorphic to H, ∑v ∈ V(H′) f(v) + ∑e ∈ E(H′) f(e) = k. Moreover, it is H-supermagic labeling if f(V) = {1,2 ,…, |V|}....
Proceedings Article

Labelling of Generalized Friendship, Windmill, and Torch Graphs with a Condition at Distance Two

Ikhsanul Halikin, Hafif Komarullah
A graph labelling with a condition at distance two was first introduced by Griggs and Robert. This labelling is also known as L(2,1)-labelling. Let G = (V, E) be a non-multiple graph, undirected, and connected. An L(2,1)-labelling on a graph is defined as a mapping from the vertex set V(G) to the set...
Proceedings Article

On the Minimum Span of Cone, Tadpole, and Barbell Graphs

Hafif Komarullah, Ikhsanul Halikin, Kiswara Agung Santoso
Let G be a simple and connected graph with p vertices and q edges. An L(2,1)-labelling on the graph G is a function f: V(G) → {0,1, …, k} such that every two vertices with a distance one receive labels that differ by at least two, and every two vertices at distance two receive labels that differ by at...
Proceedings Article

L(2,1) Labeling of Lollipop and Pendulum Graphs

Kusbudiono, Irham Af’idatul Umam, Ikhsanul Halikin, Mohamat Fatekurohman
One of the topics in graph labeling is L(2,1) labeling which is an extension of graph labeling. Definition of L(2,1) labeling is a function that maps the set of vertices in the graph to non-negative integers such that every two vertices u, v that have a distance one must have a label with a difference...
Proceedings Article

Magic and Antimagic Decomposition of Amalgamation of Cycles

Sigit Pancahayani, Annisa Rahmita Soemarsono, Dieky Adzkiya, Musyarofah
Consider G = (V, E) as a finite, simple, connected graph with vertex set V and edge set E. G is said to be a decomposable graph if there exists a collection of subgraphs of G, say ℋ = {Hi|1 ≤ i ≤n} such that for every i ≠ j, Hi is isomorphic to Hj, ∪ i=1n Hi = G and should satisfy that E(Hi) ∩ E(Hj)...
Proceedings Article

A Minimum Coprime Number for Amalgamation of Wheel

Hafif Komarullah, Slamin, Kristiana Wijaya
Let G be a simple graph of order n. A coprime labeling of a graph G is a vertex labeling of G with distinct positive integers from the set {1, 2, …, k} for some k ≥ n such that any adjacent labels are relatively prime. The minimum value of k for which G has a coprime labelling, denoted as 𝔭𝔯(G), is...
Proceedings Article

Rainbow Connection Number of Shackle Graphs

M. Ali Hasan, Risma Yulina Wulandari, A.N.M. Salman
Let G be a simple, finite and connected graph. For a natural number k, we define an edge coloring c: E(G) → {1,2,…, k} where two adjacent edges can be colored the same. A u – v path (a path connecting two vertices u and v in V(G)) is called a rainbow path if no two edges of path receive the same color....
Proceedings Article

Local Antimagic Vertex Coloring of Corona Product Graphs PnPk

Setiawan, Kiki Ariyanti Sugeng
Let G = (V, E) be a graph with vertex set V and edge set E. A bijection map f : E → {1,2, …, |E|} is called a local antimagic labeling if, for any two adjacent vertices u and v, they have different vertex sums, i.e. w(u) ≠ w(v), where the vertex sum w(u) = Σe ∈ E(u) f(e), and E(u) is the set of edges...
Proceedings Article

Local Antimagic Vertex Coloring of Gear Graph

Masdaria Natalina Br Silitonga, Kiki Ariyanti Sugeng
Let G = (V, E) be a graph that consist of a vertex set V and an edge set E. The local antimagic labeling f of a graph G with edge-set E is a bijection map from E to {1, 2, …, |E|} such that w(u) ≠ w(v), where w(u) = ∑e ∈ E(u) f(e) and E(u) is the set of edges incident to u. In this labeling, every vertex...
Proceedings Article

Implementations of Dijkstra Algorithm for Searching the Shortest Route of Ojek Online and a Fuzzy Inference System for Setting the Fare Based on Distance and Difficulty of Terrain (Case Study: in Semarang City, Indonesia)

Vani Natali Christie Sebayang, Isnaini Rosyida
Ojek Online is a motorcycle taxi that is usually used by people that need a short time for traveling. It is one of the easiest forms of transportation, but there are some obstacles in hilly areas such as Semarang City. The fare produced by online motorcycle taxis is sometimes not in accordance with the...
Proceedings Article

Granular Dynamic Simulations of Depositing Materials: Two-Dimensional Approach

Mohamad Hasan
During the deposition process, many factors play a role in the dynamics of the system including materials’ characteristics and media onto which the materials dropped. The stick-slip model has been applied to simulate the depositions of polydisperse granular materials. As the size of the materials varied,...
Proceedings Article

Active Participation and Student Journal in Confucian Heritage Culture Mathematics Classrooms

Natanael Karjanto
This article discusses an effort to encourage student-instructor interactive engagement through active learning activities during class time. We not only encouraged our students to speak out when an opportunity arises but also required them to record their active participation in a student journal throughout...
Proceedings Article

Modification Interior-Point Method for Solving Interval Linear Programming

Agustina Pradjaningsih, Fatmawati, Herry Suprajitno
Linear programming is mathematical programming developed to deal with optimization problems involving linear equations in the objective and constraint functions. One of the basic assumptions in linear programming problems is the certainty assumption. Assumption of certainty shows that all coefficients...
Proceedings Article

Generalization of Chaos Game on Polygon

Kosala D. Purnomo
The original chaos game has been applied to the triangular attractor points. With the rules for selecting attractor points randomly, the points generated in large iterations will form like a Sierpinski triangle. Several studies have developed it on the attractor points of quadrilaterals, pentagons, and...
Proceedings Article

High Order Three-Steps Newton Raphson-like Schemes for Solving Nonlinear Equation Systems

Rizki Multazamil Fatahillah, M Ziaul Arif, Rusli Hidayat, Kusbudiono, Ikhsanul Halikin
This study proposes several new 3-steps schemes based on the Newton-Raphson method for solving non-linear equation systems. The proposed schemes are analysed and formulated based on the Newton-Raphson method and the Newton-cotes open form numerical integration method. In general, the schemes can be considered...
Proceedings Article

Symmetry Functions with Respect to Any Point in Rn and Their Properties

Firdaus Ubaidillah
A function f : R → R is said to be an odd function if f(−x) = −f(x) for every x in R. The graph of an odd function is symmetric with respect to the origin, that is the point (0,0). The aims of this paper are to generalize odd functions on Rn and introduce symmetry functions with respect to any point...
Proceedings Article

Root Water Uptake Process for Different Types of Soil in Unsteady Infiltration from Periodic Trapezoidal Channels

Millatuz Zahroh, Imam Solekhudin
This study involves a non-linear partial differential equation known as Richard’s Equation. An unsteady infiltration from trapezoidal periodic irrigation channel with root-water uptake is considered as the problem. To solve the problem, A set of transformations, Kirchhoff transformation, dimensionless...
Proceedings Article

Contact Tracking with Social Network Analysis Graph

Alvida Mustika Rukmi, Wildan Zakky, M. Lutfhi Shahab
In 2020, the world is facing a Covid-19 virus pandemic. The fields of epidemiology and networks are needed in dealing with its spread. Individual (contact) tracing is an important control measure in the spread of infectious diseases. The network of contacts describes the potential pathways for the spread...
Proceedings Article

Learning Materials Development of Parametric Curves and Surfaces for Modeling the Objects Using Maple on Differential Geometry Courses

Kusno, Abduh Riski
Modeling industrial objects needs the formulas of curves and surfaces to construct a precise shape of real goods and simulate some process of form creations. For this reason, the study of the equations of curves and surfaces for objects modeling is essential for resulting in a required shape and feature...
Proceedings Article

Hanging Rotera Modeling by Joining Deformation Result of Space Geometry Objects

Een Ubaningrum, Bagus Juliyanto, Ahmad Kamsyakawuni, Firdaus Ubaidillah
The hanging rotera is a small lamp covered by a glass lid with a light source from a burning candle or LED (Light Emitting Diode) candle and hung on a support pole that is hooked to the rotera connector. The purpose of this paper are to obtain a models of the various and symmetrical components of the...
Proceedings Article

Learning Content Development in Modeling Creative Industry Objects Using Real Function Formulas Supported with Maple

Kusno, Bagus Juliyanto, Kiswara Agung Santoso
Creative industries are a national strategic commodity to support international marketing. For this reason, modeling creative industry objects are essential for resulting in various shapes and features of the goods. This paper presents to develop learning content in modeling creative goods supported...
Proceedings Article

SHINY OFFICE-R: A Web-based Data Mining Tool for Exploring and Visualizing Company Profiles

I Made Tirta, Mohamad Fatekurahman, Khairul Anam, Bayu Taruna Widjaja Putra
The profile of institutions or companies are often measured internally, nationally and internationally using several indicators that may be changed over time. We develop SHINY OFFICE-R a Web-GUI (Graphical User Interface) using R software to explore and visualize data on institution performance/ profile....
Proceedings Article

Bayesian Accelerated Failure Time Model and Its Application to Preeclampsia

Dennis Alexander, Sarini Abdullah
Preeclampsia (PE) often described as new-onset hypertension and proteinuria during the third trimester of pregnancy. PE, is one of the most feared complications of pregnancy because it can progress rapidly to serious complications, including death of both mother and fetus. It is important to get a better...
Proceedings Article

Correlation Analysis Between the Number of Confirmed Cases of COVID-19 and Stock Trading in Indonesia

Dinagusti Sianturi, Alvida Rukmi
The COVID-19 pandemic has impact in every sector of life. Studies of the impact of the COVID-19 pandemic on stock trading are also being developed in Indonesia regarding to the number of industries affected by the pandemic. This research aims to provide information about the results of the correlation...
Proceedings Article

Classification of Bank Deposit Using Naïve Bayes Classifier (NBC) and K–Nearest Neighbor (K-NN)

Muhammad Hafidh Effendy, Dian Anggraeni, Yuliani Setia Dewi, Alfian Futuhul Hadi
Banks are financial institutions whose activities are to collect funds from the public in the form of deposits (saving deposit, demand deposit, and time deposit) and distribute them to the public in the form of credit or other forms. Deposits are an alternative for customers because the interest offered...
Proceedings Article

Information Retrieval Using Matrix Methods

Case Study: Three Popular Online News Sites in Indonesia

Ferry Wiranto, I Made Tirta
This research is part of data mining, a sub-section of information retrieval and text mining. This research focuses on finding an approach to getting relevant documents online news documents with a specific threshold value and improving computing performance to get relevant documents with large documents....
Proceedings Article

Statistical Downscaling Technique Using Response Based Unit Segmentation-Partial Least Square (REBUS-PLS) for Monthly Rainfall Forecasting

Izdihar Salsabila, Alfian Futuhul Hadi, I Made Tirta, Yuliani Setia Dewi, Firdaus Ubaidillah, Dian Anggraeni
One of the newest forecasting techniques today is the Statistical Downscaling (SDs) technique. The SDs technique is a procedure for inferring high-resolution information from low-resolution variables. Forecasting rainfall using the SDs technique is to build a function that can predict the value of a...
Proceedings Article

Hurdle Regression Modelling on the Number of Deaths from Chronic Filariasis Cases in Indonesia

Nur Kamilah Sa’diyah, Ani Budi Astuti, Maria Bernadetha T. Mitakda
Poisson regression is one of the model to explain the functional relationship between response variable in the form of count and predictor variable. An important assumption in Poisson Regression analysis is equidispersion. In certain cases, where response variable consists of too many zeros, causing...
Proceedings Article

Multiple Discriminant Analysis Altman Z-Score, Multiple Discriminant Analysis Stepwise and K-Means Cluster for Classification of Financial Distress Status in Manufacturing Companies Listed on the Indonesia Stock Exchange in 2019

Hazrina Ishmah, Solimun, Maria Bernadetha Theresia Mitakda
This study uses the MDA (Multiple Discriminant Analysis) Altman Z-Score to predict the status of financial distress in manufacturing companies listed on the Indonesia Stock Exchange in 2019. MDA Stepwise model is used to prove that the variables used in the MDA Altman Z-Score method are the best variables...
Proceedings Article

Naive Bayes Classifier (NBC) for Forecasting Rainfall in Banyuwangi District Using Projection Pursuit Regression (PPR) Method

Ana Ulul Azmi, Alfian Futuhul Hadi, Yuliani Setia Dewi, I Made Tirta, Firdaus Ubaidillah, Dian Anggraeni
Rainfall is one of the climates that has a big influence on life, such as aviation, plantations, and agriculture. Remote areas like Banyuwangi Regency are most likely to lack information on weather and climate data. Rainfall information in the future is also very decisive for the community in carrying...
Proceedings Article

Analysis of Factors Affecting Poverty Depth Index in Papua Province Using Panel Data Regression

Rufina Indriani, Erma Oktania Permatasari
One of the main problems in Papua Province is poverty, because the Poverty Depth Index (P1) in Papua Province is greater than other province, which was 7.17 in 2019. This value is bigger than the Poverty Depth Index in Indonesia which was only 1.55. This study will analyse the factors that affect the...
Proceedings Article

Projection Pursuit Regression on Statistical Downscaling Using Artificial Neural Network and Support Vector Regression for Rainfall Forecasting in Jember

Chandrika Desyana Putri, Ema Fahma Farikha, Alfian Futuhul Hadi, Yuliani Setia Dewi, I Made Tirta, Firdaus Ubaidillah, Dian Anggraeni
Information about rainfall is very necessary for the country of Indonesia which bears the title of an agricultural country. This is because the agricultural sector is very vulnerable to climate change, where rainfall is one indicator of climate change-related to crops. Therefore, an accurate rainfall...
Proceedings Article

Weather Forecasting at BMKG Office Lumajang City Using Markov Chain Method

Ummi Masrurotul Jannah, Mohamat Fatekurohman
Weather forecasting is one of the important factors in everyday life, because it can affect the activities carried out by the community. Weather forecasting refers to a series of activities carried out to produce a set of information about weather conditions. One method that can be used to model these...
Proceedings Article

DOPE: MDC-2 Scheme Using PRESENT

Anjeli Lutfiani, Bety Hayat Susanti
Modification Detection Code (MDC) as an unkeyed hash function is designed to provide data integrity. Manipulation Detection Codes (MDC-2) is one of double-length (2n-bit) hash-values that requires 2 block cipher operations per block of hash input where the output size of the hash function is twice the...
Proceedings Article

Primary Key Encryption Using Hill Cipher Chain (Case Study: STIE Mandala PMB Site)

Muhamat Abdul Rohim, Kiswara Agung Santoso, Alfian Futuhul Hadi
The condition of the world experiencing the COVID-19 pandemic has resulted in some daily activities limited by health protocols. The Indonesian government’s policy in the academic field has forced STIE Mandala Jember, as one of the private universities, to implement online-based new student admissions....
Proceedings Article

A Modification of ECDSA to Avoid the Rho Method Attack

Amira Zahra, Kiki Ariyanti Sugeng
Elliptic Curve Digital Signature Algorithm (ECDSA) is a digital signature algorithm that utilizes an elliptic curve. ECDSA consists of three steps, which are key generation, signature generation, and verification algorithm. ECDSA is used on Bitcoin transactions to generate the user’s public key, private...
Proceedings Article

Image Authentication Based on Magic Square

Kiswara Agung Santoso, Maulidyah Lailatun Najah, Moh. Hasan
Image is a digital media that is easy to change, so it is susceptible to being used for crime. Image changes may be affected by the unstable internet during transmission or deliberate manipulation of images for specific purposes. Hence, we need a tool to determine the authenticity of the image. One strategy...
Proceedings Article

Pattern Recognition of Batik Madura Using Backpropagation Algorithm

Abduh Riski, Ega Bandawa Winata, Ahmad Kamsyakawuni
Since October 2, 2009, UNESCO has acknowledged batik as one of Indonesia’s intellectual properties. Throughout the archipelago, distinct and diverse batik motifs have emerged and been produced with the passage of time; Madura batik is one of them. The Backpropagation Algorithm is used to recognize Madura...
Proceedings Article

Hybrid Cat-Particle Swarm Optimization Algorithm on Bounded Knapsack Problem with Multiple Constraints

Kiswara Agung Santoso, Muhammad Bagus Kurniawan, Ahmad Kamsyakawuni, Abduh Riski
Optimization problems have become interesting problems to discuss, including the knapsack problem. There are many types and variations of knapsack problems. In this paper, the authors introduce a new hybrid metaheuristic algorithm to solve the modified bounded knapsack problem with multiple constraints...