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. ...

Irregular coloring is a proper and each vertex on graph must have different code. The color code of v where the number vertices that are adjacent to colored i. minimum k-color used in irregular called chromatic denoted by . In this paper, we discuss for bull graph, pan sun peach caveman graph.

 In the article, on basis of energy approach, phenomenon interaction between a spacecraft (spacecraft), Sun and planets is theoretically investigated. To study characteristics these celestial bodies, hypothetical model was chosen: Sun, Earth Venus are "fixed" at moment parade planets. The purpose this work to determine values potential unit mass in gravitational field Solar system each poi...

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...

Abstract Background Canby’s dropwort ( Oxypolis canbyi (J.M. Coult. & Rose) Fernald) was listed as federally endangered in 1986, yet the species has continued to decline and is no longer found 11 counties throughout its former range. The seasonal wetlands which this forb occurs are disappearing from landscape, often closing transitioning wet forest or drained converted agriculture. We docum...

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...