Vira Hari Krisnawati - Academia.edu (original) (raw)

Uploads

Papers by Vira Hari Krisnawati

Advances in computer science research, 2024

Asian research journal of mathematics, Mar 9, 2024

Barekeng, Dec 18, 2023

Article History: A bicyclic graph is a type of graph that consists of exactly two cycles. A cycle... more Article History: A bicyclic graph is a type of graph that consists of exactly two cycles. A cycle is a graph that is a closed path where no vertices are repeated except the first and last vertices which are the same. The cycles in bicyclic graph can be of different lengths and shapes, but they must have at least one common vertex. Bicyclic graphs can be divided into two categories based on the types of induced subgraphs they contain. One category consists of graphs that include an ∞-graph as an induced subgraph, while the other category comprises graphs that contain a-graph as an induced subgraph. There are 3 types of bicyclic graph without pendant vertex. A directed graph, also referred to as a digraph, is a graph in which each edge is assigned a specific direction. A directed bicyclic graph is a special kind of directed graph that contains precisely two distinct directed cycles. This graph can be applied in transportation problem. In this article, we give some examples of directed bicyclic graph in Trans Jogja routes.

JTAM (Jurnal Teori dan Aplikasi Matematika)

Graph theory is a branch of algebra that is growing rapidly both in concept and application studi... more Graph theory is a branch of algebra that is growing rapidly both in concept and application studies. This graph application can be used in chemistry, transportation, cryptographic problems, coding theory, design communication network, etc. There is currently a bridge between graphs and algebra, especially an algebraic structures, namely theory of graph algebra. One of researchs on graph algebra is a graph that formed by prime ring elements or called prime graph over ring R. The prime graph over commutative ring R (PG(R))) is a graph construction with set of vertices V(PG(R))=R and two vertices x and y are adjacent if satisfy xRy={0}, for x≠y. Girth is the shortest cycle length contains in PG(R) or can be written gr(PG(R)). Order in PG(R) denoted by |V(PG(R))| and size in PG(R) denoted by |E(PG(R))|. In this paper, we discussed prime graph over cartesian product over rings Z_m×Z_n and its complement. We focused only for m=p_1, n=p_2 and m=p_1, n=〖p_2〗^2, where p_1 and p_2 are prime n...

Bulletin de la Commission royale d'histoire. Académie royale de Belgique, 1959

CAUCHY, 2022

In this paper, we study with the definition of B-algebras, commutative B-algebras and fuzzy ideal... more In this paper, we study with the definition of B-algebras, commutative B-algebras and fuzzy ideal in B-algebras. We consider the terminology of multipolar intuitionistic fuzzy ideal. We propose about multipolar intuitionistic fuzzy ideal in B-algebras and some related properties. Then, we discuss about theorems and propositions which contain some conditions for a multipolar intuitionistic fuzzy set become a multipolar intuitionistic fuzzy ideal in B-algebras.

Linear code is a very basic code and very useful in coding theory. Generally, linear code is a co... more Linear code is a very basic code and very useful in coding theory. Generally, linear code is a code over finite field in Hamming metric. Among the most interesting families of codes, the family of self-dual code is a very important one, because it is the best known error-correcting code. The concept of Hamming metric is develop into Rosenbloom-Tsfasman metric (RT-metric). The inner product in RT-metric is different from Euclid inner product that is used to define duality in Hamming metric. Most of the codes which are self-dual in Hamming metric are not so in RT-metric. And, generator matrix is very important to construct a code because it contains basis of the code. Therefore in this paper, we give some theorems and methods to construct self-dual codes in RT-metric by considering properties of the inner product and generator matrix. Also, we illustrate some examples for every kind of the construction.

Journal of Mathematics

Let G be a finite, simple, and undirected graph with vertex set V G and edge set E G . A super ed... more Let G be a finite, simple, and undirected graph with vertex set V G and edge set E G . A super edge-magic labeling of G is a bijection f : V G ∪ E G ⟶ 1,2 , … , V G + E G such that f V G = 1,2 , … , V G and f u + f u v + f v is a constant for every edge u v ∈ E G . The super edge-magic labeling f of G is called consecutively super edge-magic if G is a bipartite graph with partite sets A and B such that f A = 1,2 , … , A and f B = A + 1 , A + 2 , … , V G . A graph that admits (consecutively) super edge-magic labeling is called a (consecutively) super edge-magic graph. The super edge-magic deficiency of G , denoted by μ s G , is either the minimum nonnegative integer n such that G ∪ n K 1 is super edge-magic or + ∞ if there exists no such n . The consecutively super edge-magic deficiency of a graph G is defined by a similar way. In this paper, we investigate the (consecutively) super edge-magic deficiency of subdivision of double stars. We show that, some of them have zero (consecutiv...

PROCEEDINGS OF THE 8TH SEAMS-UGM INTERNATIONAL CONFERENCE ON MATHEMATICS AND ITS APPLICATIONS 2019: Deepening Mathematical Concepts for Wider Application through Multidisciplinary Research and Industries Collaborations

Let G = (V, E) be a finite and simple graph with vertex set V (G) and edge set E(G), having o rde... more Let G = (V, E) be a finite and simple graph with vertex set V (G) and edge set E(G), having o rder p and size q. A graph G is called super edge-magic if there exists a bijection f : V(G) ∪ E(G) −→ {1, 2, • • • , p + q} such that f (V(G)) = {1, 2, • • • , p} and f (u) + f (uv) + f (v) = k, for every edge uv ∈ E(G). The super edge-magic deficiency of a graph G, denoted by μ s (G), is either the minimum nonnegative integer n such that G ∪ nK 1 is super edge-magic or +∞ if there exists no such n. In this paper, we study the super edge-magic deficiency of forests where its components are subdivided stars or paths.

CAUCHY, 2016

In combinatorial mathematics, a Steiner system is a type of block design. Specifically, a Steiner... more In combinatorial mathematics, a Steiner system is a type of block design. Specifically, a Steiner system S(t, k, v) is a set of v points and k blocks which satisfy that every t-subset of v-set of points appear in the unique block. It is well-known that a finite projective plane is one examples of Steiner system with t = 2, which consists of a set of points and lines together with an incidence relation between them and order 2 is the smallest order. In this paper, we observe some properties from construction of finite projective planes of order 2 and 3. Also, we analyse the intersection between two projective planes by using some characteristics of the construction and orbit of projective planes over some representative cosets from automorphism group in the appropriate symmetric group.