With simple and undirected connected graph Φ, the Schultz and modified Schultz polynomials are defined as  and , respectively, where the summation is taken over all unordered pairs of distinct vertices in V(Φ), where V(Φ) is the vertex set of Φ, degu  is the degree of vertex u and d(v,u) is the ordinary distance between v and u, u≠v. In this study, the Shultz distance, modified Schultz distance, the polynomial, index, and average for both have been generalized, and this generalization has been applied  to some special graphs.

F index is a connected graph, sum of the cubes of the vertex degrees. The forgotten topological index has been designed to be employed in the examination of drug molecular structures, which is extremely useful for pharmaceutical and medical experts in understanding the biological activities. Among all the topological indices, the forgotten index is based on degree connectivity on bonds. This paper characterized the forgotten index of union of graphs, join graphs, limits on trees and its complements, and accuracy is measured. Co-index values are analyzed for the various molecular structure of chemical compounds

Human perception involves many cognitive processes, such as memory, attention, and critical thinking. An important cognitive process is memory, which is usually connected with the storing and retrieval of information. Different colors and labeling have diverse physiological effects on humans. Our investigation aimed to determine if a change in color or labeling would have a significant effect on memory span and serial recall. However, our results do not support that coloring and labeling have significant impacts on a subject’s memory.

This paper is devoted to the discussion the relationships of connectedness between some types of graphs (resp. digraph) and Gm-closure spaces by using graph closure operators.

In a connected graph , the distance function between each pair of two vertices from a set vertex  is the shortest distance between them and the vertex degree  denoted by  is the number of edges which are incident to the vertex  The Schultz and modified Schultz polynomials of  are have defined as:

 respectively, where the summations are taken over all unordered pairs of distinct vertices in  and  is the distance between  and  in  The general forms of Schultz and modified Schultz polynomials shall be found and indices of the edge – identification chain and ring – square graphs in the present work.

In this work the diode planer magnetron sputtering device was
designed and fabricated. This device consists of two aluminum discs
(8cm) diameter and (5mm) thick. The distance between the two
electrodes is 2cm, 3cm, 4cm and 5cm.
Design and construction a double probe of tungsten wire with
(0.1mm) diameter and (1.2mm) length has been done to investigate
electron temperature, electron and ion density under different
distances between cathode and anode. The probes were situated in
the center of plasma between anode and cathode.
The results of this work show that, when the distance between
cathode and anode increased, the electron temperature decreased.
Also, the electron density increases with the increasing

In this paper we have made different regular graphs by using block designs. In one of our applicable methods, first we have changed symmetric block designs into new block designs by using a method called a union method. Then we have made various regular graphs from each of them. For symmetric block designs with  (which is named finite projective geometry), this method leads to infinite class of regular graphs. With some examples we will show that these graphs can be strongly regular or semi-strongly regular. We have also propounded this conjecture that if two semi-symmetric block designs are non-isomorphic, then the resultant block graphs of them are non-isomorphic, too.

      Face Detection by skin color in the field of computer vision is a difficult challenge. Detection of human skin focuses on the identification of pixels and skin-colored areas of a given picture. Since skin colors are invariant in orientation and size and rapid to process, they are used in the identification of human skin. In addition features like ethnicity, sensor, optics and lighting conditions that are different are sensitive factors for the relationship between surface colors and lighting (an issue that is strongly related to color stability). This paper presents a new technique for face detection based on human skin. Three methods of Probability Density Function (PDF) were applied to detect the face by skin color; these ar

The main purpose of this paper, is to introduce a topological space , which is induced by reflexive graph and tolerance graph , such that  may be infinite. Furthermore, we offered some properties of  such as connectedness, compactness, Lindelöf and separate properties. We also study the concept of approximation spaces and get the sufficient and necessary condition that topological space is approximation spaces.