In this paper, we study graphs related to knots. We investigate the connection between knot projections and graphs. We use the related graphs to catalog knot projections.

WORKSHOP ON GEOMETRIC PROBABILITY AND OPTIMAL TRANSPORTATION

In this paper, we propose a recurrent neural network model for solving the shortest path (SP) problem. Our focus on the paper is to give a novel one-layer structure recurrent neural network model to solve the SP. Moreover, ...

In the presence research, we are going to obtain the solution of the fuzzy nonlinear programming

problems (FNLP) . According to our search in the scientific reported papers, Our focus on the paper is

to give ...

In the presence research, we are going to obtain the solution of the fuzzy shortest path (FSP) problem.

According to our search in the scientific reported papers, Our focus on the paper is to give a recurrent

neural ...

A proper vertex coloring of a graph G is equitable if the size of color classes differ by at most one. The equitable chromatic number of G is the smallest integer m such that G is equitable m-colorable. In this paper, we ...

In this study researchers investigate the relationship between each of the multiple intelligences and students’ mathematical problem solving for K7 students. A sample of 209 K7 schoolgirls were tested on McKenzie's Multiple ...

In this paper we prove the generalized Hyers-Ulam-Rassia stability of extended derivations on unital Banach algebras associated to a generalized Jensen equation.

Upgrading p-median problem is a problem of finding the best median of

the given graph through modification of its parameters. The current paper develops a

polynomial-time model to address this problem when ...

A set Dof vertices in a graph Gis an efficient dominatingset (e.d.s.for short) of Gif Dis an independent set and every vertex not in Dis adjacent to exactly one vertex in D. The efficient domination (ED) problem asks for ...