Let/. It :0 ---0 G be any two self maps of a compact connected oriented Lie group G. In this paper, for each positive integer k , we associate an integer with fk,hi . We relate this number with Lefschetz coincidence number. We deduce that for any two differentiable maps f, there exists a positive integer k such that k 5.2+1 , and there is a point x C G such that ft (x) = (x) , where A is the rank of G . Introduction Let G be an n-dimensional com -pact connected Lie group with multip-lication p ( .e 44:0 xG--+G such that p ( x , y) = x.y ) and unit e . Let [G, G] be the set of homotopy classes of maps G G . Given two maps f , f G ---• Jollowing [3], we write f. f 'to denote the map G-.Gdefined by 01.11® =A/WO= fiat® ,sea Given a point g

In this paper, we show that for the alternating group An, the class C of n- cycle, CC covers An for n when n = 4k + 1 > 5 and odd. This class splits into two classes of An denoted by C and C/, CC= C/C/ was found.

This booklet contains the basic data and graphs forCOVID-19 in Iraq during the first three months of thepandemic ( 24 February to 19 May - 2020 ) , It isperformed to help researchers regarding this health problem (PDF) Information Booklet COVID-19 Graphs For Iraq First 3 Months. Available from: https://www.researchgate.net/publication/341655944_Information_Booklet_COVID-19_Graphs_For_Iraq_First_3_Months#fullTextFileContent [accessed Oct 26 2024].

In this work,  the study of corona domination in graphs is carried over which was initially proposed by G. Mahadevan et al. Let be a simple graph. A dominating set S of a graph is said to be a corona-dominating set if every vertex in is either a pendant vertex or a support vertex. The minimum cardinality among all corona-dominating sets is called the corona-domination number and is denoted by (i.e) . In this work, the exact value of the corona domination number for some specific types of graphs are given. Also, some results on the corona domination number for some classes of graphs are obtained and the method used in this paper is a well-known number theory concept with some modification this method can also be applied to obt

A new type of the connected domination parameters called tadpole domination number of a graph is introduced. Tadpole domination number for some standard graphs is determined, and some bounds for this number are obtained. Additionally, a new graph, finite, simple, undirected and connected, is introduced named weaver graph. Tadpole domination is calculated for this graph with other families of graphs.

The aim of this article is to introduce a new definition of domination number in graphs called hn-domination number denoted by . This paper presents some properties which show the concepts of connected and independent hn-domination. Furthermore, some bounds of these parameters are determined, specifically, the impact on hn-domination parameter is studied thoroughly in this paper when a graph is modified by deleting or adding a vertex or deleting an edge.