in this paper we define the removable cycle that, if $im$ is a class of graphs, $gin im$, the cycle $c$ in $g$ is called removable if $g-e(c)in im$. the removable cycles in eulerian graphs have been studied. we characterize eulerian graphs which contain two edge-disjoint removable cycles, and the necessary and sufficient conditions for eulerian graph to have removable cycles h...

Image segmentation is the process to capture the object from the background and it is a difficult task when a vision of the object is in stochastic region. Here introduce in this paper extension of stochastic random walker segmentation method. In stochastic random walker segmentation, a weighted graph is built from the image, where the each pixel considered as a node and edge weights depend on ...

 We consider a generalization of the classical quadratic assignment problem, where coordinates of locations are uncertain and only upper and lower bounds are known for each coordinate. We develop a mixed integer linear programming model as a robust counterpart of the proposed uncertain model. A key challenge is that, since the uncertain model involves nonlinear objective function of the ...

In this paper, distributed control of uncertain multi-agent systems (MAS) with completely unknown nonlinearities, time-varying coefficients and multiple directions is investigated. Firstly, a new theorem series novel Nussbaum functions are presented, which solve the outstanding problem in nonlinear signs. Secondly, global consensus MAS system nonlinearities under directed graph firstly achieved...

altan derivatives of polycyclic conjugated hydrocarbons were recently introduced and studied in theoretical organic chemistry. we now provide a generalization of the altan concept, applicable to any graph. several earlier noticed topological properties of altan derivatives of polycyclic conjugated hydrocarbons are shown to be the properties of all altan derivatives of all graphs. among these ar...

let g be a (p,q) graph. an injective map f : e(g) → {±1,±2,...,±q} is said to be an edge pair sum labeling if the induced vertex function f*: v (g) → z - {0} defined by f*(v) = σp∈ev f (e) is one-one where ev denotes the set of edges in g that are incident with a vertex v and f*(v (g)) is either of the form {±k1,±k2,...,±kp/2} or {±k1,±k2,...,±k(p-1)/2} u {±k(p+1)/2} according a...

We investigate the benefits of heterogeneity in multi-agent explore-exploit decision making where goal agents is to maximize cumulative group reward. To do so we study a class distributed stochastic bandit problems which communicate over multi-star network and make sequential choices among options same uncertain environment. Typically, problems, use homogeneous decision-making strategies. Howev...

Graph has currently become an increasingly popular model in many real applications. The efficiency of graph storage is crucial for these Generally speaking, the tuning task relies on database administrators to find best storage. However, DBAs make decisions by mainly relying their experiences and intuition. Due limitations DBAs, may have uncertain performance worse efficiency. In this paper, we...