Let G be a finite group, the result is the involution graph of G, which is an undirected simple graph denoted by the group G as the vertex set and x, y ∈ G adjacent if xy and (xy)2 = 1. In this article, we investigate certain properties of G, the Leech lattice groups HS and McL. The study involves calculating the diameter, the radius, and the girth of ΓGRI.
Autorías: Muhammad Hamza Shihab, Nuha Mohsin Dhahi. Localización: Revista iberoamericana de psicología del ejercicio y el deporte. Nº. 4, 2022. Artículo de Revista en Dialnet.
The local resolving neighborhood of a pair of vertices for and is if there is a vertex in a connected graph where the distance from to is not equal to the distance from to , or defined by . A local resolving function of is a real valued function such that for and . The local fractional metric dimension of graph denoted by , defined by In this research, the author discusses about the local fractional metric dimension of comb product are two graphs, namely graph and graph , where graph is a connected graphs and graph is a complate graph &
... Show MoreThe 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.
Let be a non-trivial simple graph. A dominating set in a graph is a set of vertices such that every vertex not in the set is adjacent to at least one vertex in the set. A subset is a minimum neighborhood dominating set if is a dominating set and if for every holds. The minimum cardinality of the minimum neighborhood dominating set of a graph is called as minimum neighborhood dominating number and it is denoted by . A minimum neighborhood dominating set is a dominating set where the intersection of the neighborhoods of all vertices in the set is as small as possible, (i.e., ). The minimum neighborhood dominating number, denoted by , is the minimum cardinality of a minimum neighborhood dominating set. In other words, it is the
... Show MoreIn this paper we introduce the basic of definitions of groups for geometric figures; we describe some of geometric figures by using the properties of groups. The classification of some geometric figures by using the properties of some algebraic structures.
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.
Background: Periodontitis and Atherosclerosis Cardiovascular disease are chronic inflammatory diseases which are highly prevalent. During the last two decades, there has been an increasing interest in the impact of oral health on atherosclerosis and subsequent cardiovascular disease.Aims of the study wereto evaluate the periodontal health status in study groups (Atherosclerotic cardiovascular disease patients with chronic periodontitis and patients having chronic periodontitis),to estimate the serum levels of Matrixmetalloproteinase-8(MMP-8) and high sensitive C-reactive protein(hs CRP) in study and control groups and compare between them. Also,test the correlation between the serum levels of MMP-8 and hs CRP with clinical periodontal par
... Show MoreIn this ˑwork, we present theˑ notion of the ˑgraph for a KU-semigroup as theˑundirected simple graphˑ with the vertices are the elementsˑ of and weˑˑstudy the ˑgraph ofˑ equivalence classesˑofˑ which is determinedˑ by theˑ definition equivalenceˑ relation ofˑ these verticesˑ, andˑ then some related ˑproperties areˑ given. Several examples are presented and some theorems are proved. Byˑ usingˑ the definitionˑ ofˑ isomorphicˑ graph, ˑwe showˑ thatˑ the graphˑ of equivalence ˑclasses ˑand the ˑgraphˑof ˑa KU-semigroup ˑ areˑ theˑ sameˑ, in special cases.
        