The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
The Smarandachely adjacent-vertex total chromatic number of graph G is the smallest positive integer k for which G has a proper total k-coloring such that for any pair of adjacent vertices u, v, the set of colors appearing at vertex u and its incident edges is not a subset of the set of colors appearing at vertex v and its incident edges. This paper,we obtain the Smarandachely adjacent-vertex total...
Let G(V, E) be a simple graph, k is a positive integer, f is a mapping from V(G) ?? E(G) to {1, 2, ..., k} such that ??uv ?? E(G), then f(u) ?? f(v); ??uv,vw ?? E(G), u ?? w,f(uv) ?? f(vw); ??uv ?? E(G),C(u) ?? C(v), we say that f is the incidence-adjacent vertex distinguishing total coloring of G. The minimum number of k is called the incidence-adjacent vertex distinguishing total chromatic number...
Let G = (V, E) be a simple graph, k (1 ?? k ?? ??(G) +1) is a positive integer, f is a mapping from V(G) ?? E(G) to {1,2, ??????, k} such that ??uv ?? E(G),f(u) ?? f(v) and C(u) = C(v) if d(u) = d(v), we say that f is the adjacent vertex reducible vertex-total coloring of G. The maximum number of k is called the adjacent vertex reducible vertex-total chromatic number of G, simply denoted by ??avrvt...
The existing iris location algorithms are of low executing speed and poor robustness. In order to improve the accuracy of iris location, an iris location algorithm based on gradient direction information is proposed according to both the ring structural characteristics of iris and the gray distribution features of eye image in this paper. Experiments shows that the algorithm is effective and can improve...
There are limitations in smaller embedded information capacity, lower accurate rate for positioning embedded location and detection, slower running speed in traditional watermarking algorithm which combines spatial domain and transform domain based on characteristics of human visual system. A fast watermarking algorithm based on quantum evolutionary algorithm is proposed and implemented. We carry...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.