In this paper, we describe an incipient method for image retrieval predicated on the local invariant shape feature, designated scalable shape context. The feature utilizes the Harris-Laplace corner to locat the fix points and coinside scale in the animal and flower image. Then, we utilize shape context to explain the local shape. Correspondence of feature points is achieved by a weighted bipart...

Graph labeling is an important area of research in Graph theory. There are many kinds of graph labeling such as Graceful labeling, Magic labeling, Prime labeling, and other different labeling techniques.In this paper the Prime labeling of certain classes of graphs are discussed.It is of interest to note that H-graph which is a 3 –regular graph satisfy Prime labeling. A Gear graph is a graph obt...

A divisor cordial labeling of a graph G with vertex set V is a bijection f from V to {1, 2, 3, . . .,|V|} such that if an edge uv is assigned the label 1 if f(u) divides f(v) or f(v) divides f(u) and 0 otherwise, then the number of edges labeled with 0 and the number of edges labeled with 1 differ by at most 1. If a graph has a divisor cordial labeling, then it is called divisor cordial graph. ...

An edge labeling of a graph G = (V,E) is a bijection from the set of edges to the set of integers {1, 2, . . . , |E|}. The weight of a vertex v is the sum of the labels of all the edges incident with v. If the vertex weights are all distinct then we say that the labeling is vertex-antimagic, or simply, antimagic. A graph that admits an antimagic labeling is called an antimagic graph. In this pa...

A popular theory of self-organized criticality relates the critical behavior of driven dissipative systems to that of systems with conservation. In particular, this theory predicts that the stationary density of the abelian sandpile model should be equal to the threshold density of the corresponding fixed-energy sandpile. This “density conjecture” has been proved for the underlying graph Z. We ...

We describe an algorithm for automatically segmenting flowers in colour photographs. This is a challenging problem because of the sheer variety of flower classes, the variability within a class and within a particular flower, and the variability of the imaging conditions – lighting, pose, foreshortening, etc. The method couples two models – a colour model for foreground and background, and a li...

Topological indices (molecular descriptors) are numerical values of a chemical structure and represented by graph. Molecular descriptors used in QSPR/QSAR modeling to determine structure’s physical, biological, properties. The cycle graphs symmetric for any number vertices. In this paper, recently defined neighborhood degree sum-based molecular polynomials studied. NM-polynomials some cycle-rel...

The Berge–Fulkerson Conjecture states that every cubic bridgeless graph has six perfect matchings such that every edge of the graph is contained in exactly two of these perfect matchings. In this paper, a useful technical lemma is proved that a cubic graph G admits a Berge–Fulkerson coloring if and only if the graph G contains a pair of edge-disjoint matchings M1 and M2 such that (i) M1 ∪ M2 in...

Abstract. A divisor cordial labeling of a graph G with vertex set V is a bijection f from V to {1, 2,... | |} V such that an edge uv is assigned the label 1 if ( ) | ( ) f u f v or ( ) | ( ) f v f u and the label 0 otherwise, then number of edges labeled with 0 and the number of edges labeled with 1 differ by at most 1. A graph with a divisor cordial labeling is called a divisor cordial graph. ...

A popular theory of self-organized criticality predicts that the stationary density of the Abelian sandpile model equals the threshold density of the corresponding fixed-energy sandpile. We recently announced that this "density conjecture" is false when the underlying graph is any of Z2, the complete graph K(n), the Cayley tree, the ladder graph, the bracelet graph, or the flower graph. In this...