In previous papers we have proposed a graphical query language for expressing traversal recursions in labelled, directed graphs. A fundamental feature of the language is the use of regular expressions to specify constraints on paths in these graphs. When only constants are allowed in regular expressions, it has been shown that these queries can be evaluated efficiently. In this paper, we study ...

we introduce a new concept of general $g$-$eta$-monotone operator generalizing the general $(h,eta)$-monotone operator cite{arvar2, arvar1}, general $h-$ monotone operator cite{xiahuang} in banach spaces, and also generalizing $g$-$eta$-monotone operator cite{zhang}, $(a, eta)$-monotone operator cite{verma2}, $a$-monotone operator cite{verma0}, $(h, eta)$-monotone operator cite{fanghuang}, $h$-...

All graphs under consideration are nonnull, finite, undirected, and simple graphs. We adopt the standard notations dG(v) for the degree of the vertex v in the graph G, and ∆(G) for the maximum degree of the vertices of G. The edge chromatic number, χ′(G), of G is the minimum number of colors required to color the edges of G in such a way that no two adjacent edges have the same color. A graph i...

Using the quantum interference of photon pairs in N-stage nonlinear interferometers (NLIs), contour joint spectral function can be modified into an islands pattern. We perform two series experiments. One is that all fibers pulse pumped NLIs are identical; other lengths N pieces different. not only demonstrate how pattern changes with stage number N, but also characterize relative intensity isla...

0