Antimagic labeling of a graph with vertices and edges is assigned the labels for its edges by some integers from the set , such that no two edges received the same label, and the weights of vertices of a graph are pairwise distinct. Where the vertex-weights of a vertex under this labeling is the sum of labels of all edges incident to this vertex, in this paper, we deal with the problem of finding vertex antimagic edge labeling for some special families of graphs called strong face graphs. We prove that vertex antimagic, edge labeling for strong face ladder graph , strong face wheel graph , strong face fan graph , strong face prism graph and finally strong face friendship graph .
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.
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.
Suppose 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 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.
Abstract
This research aims to identify the challenges faced by families of children with intellectual disabilities and to identify the impact of the challenges facing them on the mental health of their children with intellectual disabilities. Based on the following questions: What is the nature of the challenges faced by families of children with disabilities and how do these challenges affect the mental health of their children with intellectual disabilities? The study was conducted on a sample of four families of six children with intellectual disabilities, depending on the degree and type of disability. To achieve the study's objectives, the qualitative approach was used, Because of the importance of accessin
... Show MoreThe 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 study aims to identify the degree of implementation of the coronavirus prevention standards (covid-19) in the kingdom of Saudi Arabia and compare it with the families of intellectual disabilities. The study population consisted of all families residing in the Kingdom of Saudi Arabia. To achieve the objectives of the research, the analytical descriptive approach was employed. The study sample consisted of (372) families, among them (84) families with intellectual disabilities, and (288) families without intellectual disabilities. They were chosen from the Saudi community according to what is available for collection in a simple random way, using the standard criteria for the prevention of coronavirus (Covid- 19) Prepared by the resear
... 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.
A taxonomic keys was established of book and bark lice Order Psocoptera to isolated insects in Iraq from different localities of Baghdad and Babylon provinces. Thirteen species belong to eight genera and five families have been studied and described in details, these species were recorded for the first time in Iraq. These species are: Belaphopsocus badonneli New, 1971; Belaphotroctes oculeris Bodonnel, 1973; Embodopsocosis newi Bodonnel, 1973; Epipsocus stigamaticus Mockeord, 1991; Lepinotus huoni Schmidt and New, 2008; Liposcelies decolor Peramane 1925 Liposcelies paeta Pearman 1942 Liposclies bostrychphila Badonnel 1931; Liposclies brunnea Mostchulsky 1852; Liposclies entoophila Enderlein 1907; Neopsocopsis minuscule Li 2002 ;
... 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.