The metric dimension dim(G) of a graph G is the minimum number of vertices such that every vertex of G is uniquely determined by its vector of distances to the chosen vertices. The zero forcing number Z(G) of a graph G is the minimum cardinality of a set S of black vertices (whereas vertices in V (G)\S are colored white) such that V (G) is converted entirely to black after finitely many applica...

Perfect matchings in chemical graphs correspond to Kekulé structures underlying structure, which play an important role the analysis of resonance energy and stability certain compounds. In 2007, Vukičević Trinajstić introduced concept anti-Kekulé number be smallest edges that have removed from a graph such it remains connected but without any perfect matching. Thereafter, this parameter attract...

The probability density function (PDF) of the gas density in turbulent supersonic flows is investigated with high-resolution numerical simulations. In a systematic study, we compare the density statistics of compressible turbulence driven by the usually adopted solenoidal forcing (divergence-free) and by compressive forcing (curl-free). Our results are in agreement with studies using solenoidal...

‎in this paper‎, ‎we investigate a damped korteweg-de‎ ‎vries equation with forcing on a periodic domain‎ ‎$mathbb{t}=mathbb{r}/(2pimathbb{z})$‎. ‎we can obtain that if the‎ ‎forcing is periodic with small amplitude‎, ‎then the solution becomes‎ ‎eventually time-periodic.

The investigation of impact of fuzzy sets on zero forcing set is the main aim of this paper. According to this, results lead us to a new concept which we introduce it as Fuzzy Zero Forcing Set (FZFS). We propose this concept and suggest a polynomial time algorithm to construct FZFS. Further more we compute the propagation time of FZFS on fuzzy graphs. This concept can be more efficient to model...

For an ordered set W = {w1, w2, . . . , wk} of vertices and a vertex v in a connected graph G, the (metric) representation of v with respect to W is the k-vector r(v|W ) = (d(v,w1), d(v, w2), . . . , d(v, wk)), where d(x, y) represents the distance between the vertices x and y. The setW is a resolving set for G if distinct vertices of G have distinct representations. A resolving set of minimum ...