Assignment problem is an important subject discussed in real physical world. We endeavor in this paper to introduce a new approach to assignment problem namely, ones assignment method, for solving a wide rang of such problems. This method offers significant advantages over similar methods, in the process, first we define the assignment matrix, then by using determinant representation we obtain ...

Fix a graph G , list-assignment L for and -colorings α β . An -recoloring sequence, starting from recolors single vertex at each step, so that resulting intermediate coloring is proper -coloring. sequence transforms to if its initial final We prove there exists an most constant number of times (i) triangle-free planar 7-assignment, or (ii) mad ( ) < 17 / 5 6-assignment (iii) 22 9 4-assignment. ...

The problem of pole assignment, also known as an eigenvalue assignment, in linear discrete-time periodic systems in discs was solved by a novel method which employs elementary similarity operations. The former methods tried to assign the points inside the unit circle while preserving the stability of the discrete time periodic system. Nevertheless, now we can obtain the location of eigenvalues ...