Hajar Alimorad
Department of mathematics, Jahrom Univertsity
[ 1 ] - A practical algorithm for [r, s, t]-coloring of graph
Coloring graphs is one of important and frequently used topics in diverse sciences. In the majority of the articles, it is intended to find a proper bound for vertex coloring, edge coloring or total coloring in the graph. Although it is important to find a proper algorithm for graph coloring, it is hard and time-consuming too. In this paper, a new algorithm for vertex coloring, edge coloring an...
[ 2 ] - Finding the Optimal Place of Sensors for a 3-D Damped Wave Equation by using Measure Approach
In this paper, we model and solve the problem of optimal shaping and placing to put sensors for a 3-D wave equation with constant damping in a bounded open connected subset of 3-dimensional space. The place of sensor is modeled by a subdomain of this region of a given measure. By using an approach based on the embedding process, first, the system is formulated in variational form;...
نویسندگان همکار