The concept of an antipodal bipolar fuzzy graph of a given bipolar fuzzy graph is introduced. Characterizations of antipodal bipolar fuzzy graphs are presented when the bipolar fuzzy graph is complete or strong. Some isomorphic properties of antipodal bipolar fuzzy graph are discussed. The notion of self median bipolar fuzzy graphs of a given bipolar fuzzy graph is also introduced.

Structural approaches for pattern recognition frequently make use of graphs to represent objects. The concept of object similarity is of great importance in pattern recognition. The graph edit distance is often used to measure the similarity between two graphs. It basically consists in the amount of distortion needed to transform one graph into the other. The median graph of a set S of graphs i...

In this paper the performance of four well-known metaheuristics consisting of Artificial Bee Colony (ABC), Biogeographic Based Optimization (BBO), Harmony Search (HS) and Teaching Learning Based Optimization (TLBO) are investigated on optimal domain decomposition for parallel computing. A clique graph is used for transforming the connectivity of a finite element model (FEM) into that of the cor...

Median graphs are characterized among direct products of graphs on at least three vertices. Beside some trivial cases, it is shown that one component of G × P3 is median if and only if G is a tree in that the distance between any two vertices of degree at least 3 is even. In addition, some partial results considering median graphs of the form G ×K2 are proved, and it is shown that the only nonb...

We derive the equilibrium institutional design of representative democracy by citizens who first vote on the supermajority required for a new policy to be adopted, and then delegate decision making to a legislature that selects policy given that institutional constraint. A legislature that can freely tailor policy to reflect society’s current preferences is good. However, the views of the media...

Amedian of a sequence π = x1, x2, . . . , xk of elements of a finite metric space (X, d) is an element x for which ∑k i=1 d(x, xi) is minimum. The function M with domain the set of all finite sequences on X and defined by M(π) = {x : x is a median of π} is called the median function on X, and is one of the most studied consensus functions. Based on previous characterizations of median sets M(π)...

The general form of PBFs corresponding to one weight WM filters, which are a subclass of WM filters, is derived in this paper. Based on the results, it is straightforward to derive the corresponding PBF from a given one weight WM filter or vice versa. The results can also be used to check whether an PBF corresponds to an one weight WM filters. The checking procedure is very simple and tractable...

In crowdsourcing, a range task is a type of creation task where only free answers belonging to the numeric domain are accepted/possible. In this paper, we present the median-onagreement (ma) techniques based on statistical and consensusbased mechanisms for determining the result of range tasks. The ma techniques are characterized by i) the distinction between the group of workers that agree (i....