Consider a simple graph   on vertices and edges together with a total  labeling . Then ρ is called total edge irregular labeling if there exists a one-to-one correspondence, say  defined by  for all  where  Also, the value  is said to be the edge weight of . The total edge irregularity strength of the graph G is indicated by  and is the least  for which G admits   edge irregular h-labeling.  In this article,   for some common graph families are examined. In addition, an open problem is solved affirmatively.

The visual stimulus is the effective force in visual attraction that achieves visual and perceptual co-optation and is important in wooing the recipient, and many procedural processes in the design are interpreted on it as the visual stimulus achieves visual comfort and a sense of pleasure and gives (place) the interior space a transformation in its plastic structure as well as arousing attention through The kinetic rhythm and the formal diversity, which increases the possibility of breaking the routine and traditional constraints of design patterns through the coating and encapsulation of the vertical and horizontal levels . Thus, the research problem was launched based on the following question: What are the stimuli of the visual stimu

The research deals with one of the urban problems facing cities, namely the existence of neglected urban spaces that need to be activated , These spaces give a negative image of the city, is not conducive to life and social interactions or the city has a one distinctive urban experience, leading to a reduction peoples' confidence in revisiting of those areas, hinder the rest of the activities in that region . Because these spaces are of the basic components of the city and give it its identity through the elements and entities that constitute it  , The idea of research emerged in the reclaiming of these spaces within contemporary urban trends and the activation of  flexible  , short-term and inovation for that purpose with

The basic concepts of some near open subgraphs, near rough, near exact and near fuzzy graphs are introduced and sufficiently illustrated. The Gm-closure space induced by closure operators is used to generalize the basic rough graph concepts. We introduce the near exactness and near roughness by applying the near concepts to make more accuracy for definability of graphs. We give a new definition for a membership function to find near interior, near boundary and near exterior vertices. Moreover, proved results, examples and counter examples are provided. The Gm-closure structure which suggested in this paper opens up the way for applying rich amount of topological facts and methods in the process of granular computing.

The test considers from important methods and tools when we using the evaluation because it is a basic role in diagnosis & classification & motive & selection &guiding &prediction and the problem was formatted in some questions like ( what is physical variables that tall players needs n the game and effect on the game ? what is the tests that measures these variables also the defense rebound variable and is there a references standard specialized in that ?) , the aims of research represented by knowing to some physical abilities for tall players in basketball school and their tests and putting new tests to measure defense rebound to one player and tow tall players also limiting the standards degrees ( modified un following method ) to resul

The chemical properties of chemical compounds and their molecular structures are intimately connected. Topological indices are numerical values associated with chemical molecular graphs that help in understanding the physicochemical properties, chemical reactivity and biological activity of a chemical compound. This study obtains some topological properties of second and third dominating David derived (DDD) networks and computes several K Banhatti polynomial of second and third type of DDD.