Local feature matching is an essential component of many image and object retrieval algorithms. Feature similarities between object model and scene graph are complemented with a regularization term that measures differences of the relational structure. In this paper, we present a novel approach to the optimal feature matching using new Bayesian graph theory. First, we will discuss properties of...

Let G=(V(G),E(G)) be a graph.A set of vertices S in a graph G is called to be a Smarandachely dominating k-set, if each vertex of G is dominated by at least k vertices of S. Particularly, if k = 1, such a set is called a dominating set of G. The Smarandachely domination k -number γk(G) of G is the minimum cardinality of a Smarandachely dominating k -set of G. S is called weak domination set if ...

Let s denote a distinguished source vertex of a non-negatively real weighted and undirected graph G with n vertices and m edges. In this paper we present two efficient single-source approximatedistance sensitivity oracles, namely compact data structures which are able to quickly report an approximate (by a multiplicative stretch factor) distance from s to any node of G following the failure of ...

a graph is called textit{circulant} if it is a cayley graph on a cyclic group, i.e. its adjacency matrix is circulant. let $d$ be a set of positive, proper divisors of the integer $n>1$. the integral circulant graph $icg_{n}(d)$ has the vertex set $mathbb{z}_{n}$ and the edge set e$(icg_{n}(d))= {{a,b}; gcd(a-b,n)in d }$. let $n=p_{1}p_{2}cdots p_{k}m$, where $p_{1},p_{2},cdots,p_{k}$ are disti...