The cycles of a graph give natural cyclic ordering to their edge-sets, and these orderings are consistent in that two edges adjacent one cycle if only they every which appear together. An orderable matroid is whose set circuits admits such ordering. In this paper, we consider the question determining matroids orderable. Although able answer for non-binary matroids, it remains open binary matroi...

Most past research work on problem subgoal ordering are of a heuristic nature and very little attempt has been made to reveal the inherent relationship between subgoal ordering constraints and problem operator schemata. As a result, subgoal ordering strategies which have been developed tend to be either overly committed, imposing ordering on subgoals subjectively or randomly, or overly restrict...

We investigate the problem of finding a total order of a finite set that satisfies various local ordering constraints. Depending on the admitted constraints, we provide an efficient algorithm or prove NP-completeness. To this end, we define a reduction technique and discuss its properties.

ranking fuzzy numbers plays a very important role in linguistic decision making and other fuzzy application systems. in spite of many ranking methods, no one can rank fuzzy numbers with human intuition consistently in all cases. shortcoming are found in some of the convenient methods for ranking triangular fuzzy numbers such as the coefficient of variation (cv index), distance between fuzzy set...

‎for a graph $g$ with edge set $e(g)$‎, ‎the multiplicative second zagreb index of $g$ is defined as‎ ‎$pi_2(g)=pi_{uvin e(g)}[d_g(u)d_g(v)]$‎, ‎where $d_g(v)$ is the degree of vertex $v$ in $g$‎. ‎in this paper‎, ‎we identify the eighth class of trees‎, ‎with the first through eighth smallest multiplicative second zagreb indeces among all trees of order $ngeq 14$‎.