Article Per Year (5 Year)
p-Index From 2019 - 2024
1.182
P-Index
This Author published in this journals
All Journal BAREKENG: Jurnal Ilmu Matematika dan Terapan Journal of Fundamental Mathematics and Applications Jurnal Matematika Integratif
Yeni Susanti
Dept. of Mathematics, Gadjah Mada University
Computer Science & IT Control & Systems Engineering Decision Sciences, Operations Research & Management Economics, Econometrics & Finance Electrical & Electronics Engineering Energy Engineering Mathematics Mechanical Engineering Physics Transportation

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

Found 7 Documents
Search

 1 
SOME CARTESIAN PRODUCTS OF A PATH AND PRISM RELATED GRAPHS THAT ARE EDGE ODD GRACEFUL Yeni Susanti; Iwan Ernanto; Aluysius Sutjijana; Sufyan Sidiq
Journal of Fundamental Mathematics and Applications (JFMA) Vol 4, No 2 (2021)
Publisher : Diponegoro University

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (1090.106 KB) | DOI: 10.14710/jfma.v4i2.11607

Abstract

Let $G$ be a connected undirected simple graph of size $q$ and let $k$ be the maximum number of its order and its size. Let $f$ be a bijective edge labeling which codomain is the set of odd integers from 1 up to $2q-1$. Then $f$ is called an edge odd graceful on $G$ if the weights of all vertices are distinct, where the weight of a vertex $v$ is defined as the sum $mod(2k)$ of all labels of edges incident to $v$. Any graph that admits an edge odd graceful labeling is called an edge odd graceful graph. In this paper, some new graph classes that are edge odd graceful are presented, namely some cartesian products of path of length two and some circular related graphs.
GENERALIZED NON-BRAID GRAPHS OF RINGS Era Setya Cahyati; Rambu Maya Imung Maharani; Sri Nurhayati; Yeni Susanti
Journal of Fundamental Mathematics and Applications (JFMA) Vol 5, No 2 (2022)
Publisher : Diponegoro University

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.14710/jfma.v5i2.14152

Abstract

In this paper, we introduce the definition of generalized non-braid graph of a given ring. Let $R$ be a ring and let $k$ be a natural number. By generalized braider of $R$ we mean the set $B^k(R):=\{x \in R~|~\forall y \in R,~ (xyx)^k = (yxy)^k\}$. The generalized non-braid graph of $R$, denoted by $G_k(\Upsilon_R)$, is a simple undirected graph with vertex set $R\backslash B^k(R)$ and two distinct vertices $x$ and $y$ are adjacent if and only if $(xyx)^k \neq (yxy)^k$. In particular, we investigate some properties of generalized non-braid graph $G_k(\Upsilon_{\mathbb{Z}_n})$ of the ring $\mathbb{Z}_n$.
An Edge Irregular Reflexive k−labeling of Comb Graphs with Additional 2 Pendants Sri Nurhayati; Yeni Susanti
Jurnal Matematika Integratif Vol 19, No 1: April 2023
Publisher : Department of Matematics, Universitas Padjadjaran

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (467.384 KB) | DOI: 10.24198/jmi.v19.n1.41624.89-108

Abstract

Let G be a connected, simple, and undirrected graph, where V (G) is the vertex set and E(G) is the edge set. Let k be a natural numbers. For graph G we define a total k−labeling ρ such that the vertices of graph G are labeled with {0, 2, 4, . . . , 2kv} and the edges of graph G are labeled with {1, 2, 3, . . . , ke}, where k = max{2kv, ke}. Total k−labeling ρ called an edge irregular reflexive k− labeling if every two distinct edge of graph G have distinct edge weights, where the edge weight is defined as the sum of the label of that edge and the label of the vertices that are incident to this edge. The minimum k such that G has an edge irregular reflexive k−labeling called the reflexive edge strength of G. In this paper we determine the reflexive edge strength of some comb graphs.
BIPARTITE GRAPH ASSOCIATED WITH ELEMENTS AND COSETS OF SUBRINGS OF FINITE RINGS Hubbi Muhammad; Niswah Qonita; R A Wahyu Fibriyanti; Yeni Susanti
BAREKENG: Jurnal Ilmu Matematika dan Terapan Vol 17 No 2 (2023): BAREKENG: Journal of Mathematics and Its Applications
Publisher : PATTIMURA UNIVERSITY

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30598/barekengvol17iss2pp0667-0672

Abstract

Let be a finite ring. The bipartite graph associated to elements and cosets of subrings of is a simple undirected graph with vertex set , where is the set of all subrings of , and two vertices and are adjacent if and only if In this study, we investigate some basic properties of the graph . In particular, we investigate some properties of , where is the ring of matrices over Also, we study the diameter of the bipartite graph associated to the quaternion ring
TOTAL EDGE IRREGULAR LABELING FOR TRIANGULAR GRID GRAPHS AND RELATED GRAPHS Muhammad Nurul Huda; Yeni Susanti
BAREKENG: Jurnal Ilmu Matematika dan Terapan Vol 17 No 2 (2023): BAREKENG: Journal of Mathematics and Its Applications
Publisher : PATTIMURA UNIVERSITY

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30598/barekengvol17iss2pp0855-0866

Abstract

Let be a graph with and are the set of its vertices and edges, respectively. Total edge irregular -labeling on is a map from to satisfies for any two distinct edges have distinct weights. The minimum for which the satisfies the labeling is spoken as its strength of total edge irregular labeling, represented by . In this paper, we discuss the tes of triangular grid graphs, its spanning subgraphs, and Sierpiński gasket graphs.
ON THE GIRTH, INDEPENDENCE NUMBER, AND WIENER INDEX OF COPRIME GRAPH OF DIHEDRAL GROUP Agista Surya Bawana; Aluysius Sutjijana; Yeni Susanti
BAREKENG: Jurnal Ilmu Matematika dan Terapan Vol 17 No 3 (2023): BAREKENG: Journal of Mathematics and Its Applications
Publisher : PATTIMURA UNIVERSITY

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30598/barekengvol17iss3pp1695-1702

Abstract

The coprime graph of a finite group , denoted by , is a graph with vertex set such that two distinct vertices and are adjacent if and only if their orders are coprime, i.e., where |x| is the order of x. In this paper, we complete the form of the coprime graph of a dihedral group that was given by previous research and it has been proved that if , for some and if . Moreover, we prove that if is even, then the independence number of is , where is the greatest odd divisor of and if is odd, then the independence number of is . Furthermore, the Wiener index of coprime graph of dihedral group has been stated here.
PRIME LABELING OF SOME WEB GRAPHS WITHOUT CENTER Jovanco Albertha Scada; Yeni Susanti
Journal of Fundamental Mathematics and Applications (JFMA) ARTICLES IN PRESS
Publisher : Diponegoro University

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.14710/jfma.v0i0.19862

Abstract

The prime labeling of a graph  \(G\) of order \(n\) is a bijection function from the set of vertices in \(G\) to the set of the first \(n\) positive integers, such that any two adjacent points in \(G\) have labels that are coprime to each other. In this paper  we discuss the primality of the graph \(W_0(2,n)\) along with its combinations with similar graphs and various types of edges subdivisions in the graph \(W_0(2,n)\). Moreover, it is also presented the necessary and sufficient conditions for the graph to be prime.
Co-Authors Agista Surya Bawana Aluysius Sutjijana Aluysius Sutjijana Era Setya Cahyati Hubbi Muhammad Jovanco Albertha Scada Muhammad Nurul Huda Niswah Qonita R A Wahyu Fibriyanti Rambu Maya Imung Maharani Sri Nurhayati Sri Nurhayati Sufyan Sidiq