In 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.
Until The Second Half Of Nineteenth Century , Psychology Depended On Philosophy In Its Experiences Which Means It Depend On Individuals Feelings Toward Psychological Experiences And Rapid Observation . As For The Scientific Organized Experimentation And Observation By Machines Have Been Used Later .
The Experimentation Looking For The Cause Of Phenomena And How Is That Happened Also Reveal The Causal Relationship Between Among Phenomena . The Experiences In Psychology Field Include In Its Simplest Form Only One Variable ( Effective) Which Is Called Independent Variable As Well As Another Variable ( Affected ) That Called Dependent Variable .
... Show MoreIn this paper, we study the effect of group homomorphism on the chain of level subgroups of fuzzy groups. We prove a necessary and sufficient conditions under which the chains of level subgroups of homomorphic images of an a arbitrary fuzzy group can be obtained from that of the fuzzy groups . Also, we find the chains of level subgroups of homomorphic images and pre-images of arbitrary fuzzy groups
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.
(3)
(1)
(3)
(1)
In the present paper, we have introduced some new definitions On D- compact topological group and D-L. compact topological group for the compactification in topological spaces and groups, we obtain some results related to D- compact topological group and D-L. compact topological group.
In the present paper, we have introduced some new definitions On D- compact topological group and D-L. compact topological group for the compactification in topological spaces and groups, we obtain some results related to D- compact topological group and D-L. compact topological group.
The Detour distance is one of the most common distance types used in chemistry and computer networks today. Therefore, in this paper, the detour polynomials and detour indices of vertices identified of n-graphs which are connected to themselves and separated from each other with respect to the vertices for n≥3 will be obtained. Also, polynomials detour and detour indices will be found for another graphs which have important applications in Chemistry.
The main object of this paper is to study the representations of monomial groups and characters technique for representations of monomial groups. We refer to monomial groups by M-groups. Moreover we investigate the relation of monomial groups and solvable groups. Many applications have been given the symbol G e.g. group of order 297 is an M-group and solvable. For any group G, the factor group G/G? (G? is the derived subgroup of G) is an M-group in particular if G = Sn, SL(4,R).
Let G be a finite group and X be a conjugacy class of order 3 in G. In this paper, we introduce a new type of graphs, namely A4-graph of G, as a simple graph denoted by A4(G,X) which has X as a vertex set. Two vertices, x and y, are adjacent if and only if x≠y and x y-1=y x-1. General properties of the A4-graph as well as the structure of A4(G,X) when G@ 3D4(2) will be studied.
(6)
(1)
(3)
(1)