The aim of this paper is to generate topological structure on the power set of vertices of digraphs using new definition which is Gm-closure operator on out-linked of digraphs. Properties of this topological structure are studied and several examples are given. Also we give some new generalizations of some definitions in digraphs to the some known definitions in topology which are Ropen subgraph, α-open subgraph, pre-open subgraph, and β-open subgraph. Furthermore, we define and study the accuracy of these new generalizations on subgraps and paths.
Evolutionary·co.nipimit'iQo is a· c'!a s of glbbal ·searb techniq
based on the lei.lffi:ing process ,of g po_pl)'latiog-·of pote.n:tiaf solutions to
a ven probl_e-ID'. thahas .been succe_ssfull'y applied 19 v ety of
prQblern, lll thls paper a riew approach to. design lie_ ural ne'twQj:ks
based oh ev.ohltipnary -computa.tio.rt i·s pre.Seri-L _A tine-f.!£ clurP.mosome
'repr:esentati:on or the etwor}< i_s. u_secl: 'Q.y genetiC gperntb_l:s, whicQ
allow th¢ voJution of.the chitecture and' weight-s Â
... Show MoreAssume that G is a finite group and X is a subset of G. The commuting graph is denoted by С(G,X) and has a set of vertices X with two distinct vertices x, y Î X, being connected together on the condition of xy = yx. In this paper, we investigate the structure of Ϲ(G,X) when G is a particular type of Leech lattice groups, namely Higman–Sims group HS and Janko group J2, along with X as a G-conjugacy class of elements of order 3. We will pay particular attention to analyze the discs’ structure and determinate the diameters, girths, and clique number for these graphs.
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.
Background: The displacement of artificial teeth during complete denture construction presents major processing errors in the occlusal vertical dimension which were verified at the previous trial denture stage. The aim of this study was to assess the effect of delay in processing after final flask closure and tension application on the vertical acrylic and porcelain teeth displacement of complete dentures constructed from heat cured acrylic and the results were compared with the conventional processing method. Materials and methods: forty samples of identical maxillary complete dentures were constructed from heat polymerized acrylic resin. These samples were subdivided into the following experimental subgroups in which each subgroup contai
... Show MoreIn this paper we used Hosoya polynomial ofgroupgraphs Z1,...,Z26 after representing each group as graph and using Dihedral group to"encrypt the plain texts with the immersion property which provided Hosoya polynomial to immerse the cipher text in another"cipher text to become very"difficult to solve.
The current research dealt with the issue of organizational skillfulness as an entry point to reach strategic agility. The study has been tested in Iraq's mobile operators - Asia Cell, Zain Iraq and Cork Telecom. The study was applied to a sample of (93) managers distributed at various levels of management (board members, general managers, commissioners, department managers, people managers, unit managers, office managers). The survey used the questionnaire as a key tool for collecting data and information as well as personal interviews. It has sought to test a number of hypotheses related to correlation and influence relationships between the variables of the study, in order to answer the questions related to the problem of stud
... Show MoreSuppose that is a finite group and is a non-empty subset of such that and . Suppose that is the Cayley graph whose vertices are all elements of and two vertices and are adjacent if and only if . In this paper, we introduce the generalized Cayley graph denoted by that is a graph with vertex set consists of all column matrices which all components are in and two vertices and are adjacent if and only if , where is a column matrix that each entry is the inverse of similar entry of and is matrix with all entries in , is the transpose of and . In this paper, we clarify some basic properties of the new graph and assign the structure of when is complete graph , complete bipartite graph and complete
... Show MoreThe purpose of this paper is to find the best multiplier approximation of unbounded functions in –space by using some discrete linear positive operators. Also we will estimate the degree of the best multiplier approximation in term of modulus of continuity and the averaged modulus.
The purpose of this paper is to introduce a new type of compact spaces, namely semi-p-compact spaces which are stronger than compact spaces; we give properties and characterizations of semi-p-compact spaces.
In this paper, certain types of regularity of topological spaces have been highlighted, which fall within the study of generalizations of separation axioms. One of the important axioms of separation is what is called regularity, and the spaces that have this property are not few, and the most important of these spaces are Euclidean spaces. Therefore, limiting this important concept to topology is within a narrow framework, which necessitates the use of generalized open sets to obtain more good characteristics and preserve the properties achieved in general topology. Perhaps the reader will realize through the research that our generalization preserved most of the characteristics, the most important of which is the hereditary property. Two t
... Show More