Article Per Year (5 Year)
p-Index From 2020 - 2025
1.151
P-Index
This Author published in this journals
All Journal Journal of Fundamental Mathematics and Applications (JFMA) 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 Engineering Mechanical Engineering Transportation

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

Found 5 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.
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.
PRIME LABELING OF SOME WEB GRAPHS WITHOUT CENTER Scada, Jovanco Albertha; Susanti, Yeni
Journal of Fundamental Mathematics and Applications (JFMA) Vol 7, No 1 (2024)
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.
GENERALIZED NON-BRAID GRAPHS OF RINGS Cahyati, Era Setya; Maharani, Rambu Maya Imung; Nurhayati, Sri; Susanti, Yeni
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$.
On the necessary and sufficient condition of a k-Euler pair Wijaya, Yosua Feri; Isnaini, Uha; Susanti, Yeni
Journal of Fundamental Mathematics and Applications (JFMA) Vol 8, No 1 (2025)
Publisher : Diponegoro University

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

Abstract

In this paper, we discuss George Andrews’ definition of an Euler pair andSubbarao’s generalization of the Euler pair to a k-Euler pair. Let N and M be non-empty sets of natural numbers. A pair (N, M) is called a k-Euler pair if, for any natural number n, the number of partitions of n into parts from N is equal to the number of partitions of n into parts  from M, with  the  condition  that  each  part  appears  fewer than k times. We further explore several theorems concerning Euler pairs that were established by Andrews and Subbarao, and we present proofs using a method distinct from those previously utilized.
Co-Authors Aluysius Sutjijana Cahyati, Era Setya Isnaini, Uha Maharani, Rambu Maya Imung Scada, Jovanco Albertha Sri Nurhayati Sri Nurhayati Sufyan Sidiq Wijaya, Yosua Feri