Preferred Language
Articles
/
ijs-8497
Generalized Schultz and Modified Schultz Polynomials for Some Special Graphs

With simple and undirected connected graph Φ, the Schultz and modified Schultz polynomials are defined as  and , respectively, where the summation is taken over all unordered pairs of distinct vertices in V(Φ), where V(Φ) is the vertex set of Φ, degu  is the degree of vertex u and d(v,u) is the ordinary distance between v and u, u≠v. In this study, the Shultz distance, modified Schultz distance, the polynomial, index, and average for both have been generalized, and this generalization has been applied  to some special graphs.

Scopus Crossref
View Publication Preview PDF
Quick Preview PDF
Publication Date
Wed Jun 01 2022
Journal Name
Baghdad Science Journal
Schultz and Modified Schultz Polynomials for Edge – Identification Chain and Ring – for Square 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.

View Publication Preview PDF
Scopus (3)
Crossref (1)
Scopus Clarivate Crossref
Publication Date
Thu Jul 01 2021
Journal Name
Iraqi Journal Of Science
M_n – Polynomials of Some Special Graphs

 Let  be a connected graph with vertices set  and edges set . The ordinary distance between any two vertices of  is a mapping  from  into a nonnegative integer number such that  is the length of a shortest  path. The maximum distance between two subsets  and  of   is the maximum distance between any two vertices  and  such that  belong to  and  belong to . In this paper, we take a special case of maximum distance when  consists of one vertex and  consists of  vertices, . This distance is defined by: where  is the order of  a graph .

     In this paper, we defined  – polynomials based on

... Show More
View Publication Preview PDF
Scopus (5)
Crossref (1)
Scopus Crossref
Publication Date
Sat Apr 01 2023
Journal Name
Baghdad Science Journal
Detour Polynomials of Generalized Vertex Identified of Graphs

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.

 

View Publication Preview PDF
Scopus Crossref
Publication Date
Wed Oct 20 2021
Journal Name
Ibn Al-haitham Journal For Pure And Applied Sciences
Some Topological and Polynomial Indices (Hosoya and Schultz) for the Intersection Graph of the Subgroup of〖 Z〗_(r^n )

         Let  be any group with identity element (e) . A subgroup intersection graph of  a subset  is the Graph with V ( ) =  - e and two separate peaks c and d contiguous for c and d if and only if      , Where  is a Periodic subset of resulting from  . We find some topological indicators in this paper and Multi-border (Hosoya and Schultz) of   , where    ,  is aprime number.

View Publication Preview PDF
Crossref
Publication Date
Wed Mar 01 2023
Journal Name
Baghdad Science Journal
An Investigation of Corona Domination Number for Some Special Graphs and Jahangir Graph

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

... Show More
View Publication Preview PDF
Scopus (2)
Crossref (2)
Scopus Clarivate Crossref
Publication Date
Sun Jul 30 2023
Journal Name
Iraqi Journal Of Science
Some Results on the Generalized Cayley Graph of Complete Graphs

     . 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  which is a graph with a vertex set consisting of all column matrices  in 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 the similar entry of  and  is  matrix with all entries in  ,  is the transpose of  and  and m . We aim to provide some basic properties of the new graph and determine the structure of  when  is a complete graph  for every , and n, m  .

View Publication Preview PDF
Scopus Crossref
Publication Date
Sun Nov 22 2020
Journal Name
Ibn Al-haitham Journal For Pure And Applied Sciences
Topological Structure of Generalized Rough Graphs

The main purpose of this paper, is to introduce a topological space , which is induced by reflexive graph and tolerance graph , such that  may be infinite. Furthermore, we offered some properties of  such as connectedness, compactness, Lindelöf and separate properties. We also study the concept of approximation spaces and get the sufficient and necessary condition that topological space is approximation spaces.

View Publication Preview PDF
Crossref
Publication Date
Mon Nov 19 2018
Journal Name
Ibn Al-haitham Journal For Pure And Applied Sciences
Cryptography by Using"Hosoya"Polynomials for"Graphs Groups of Integer Modulen and"Dihedral Groups with'Immersion"Property

      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.

View Publication Preview PDF
Crossref
Publication Date
Fri Jan 20 2023
Journal Name
Ibn Al-haitham Journal For Pure And Applied Sciences
On Antimagic Labeling for Some Families of Graphs

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 .

View Publication Preview PDF
Crossref
Publication Date
Tue Jan 01 2013
Journal Name
Iraqi Journal Of Physics
Describing the Wavefront Aberrations of the Hexagonal Aperture Using Modified Zernike Polynomials

n Segmented Optical Telescope (NGST) with hexagonal segment of spherical primary mirror can provide a 3 arc minutes field of view. Extremely Large Telescopes (ELT) in the 100m dimension would have such unprecedented scientific effectiveness that their construction would constitute a milestone comparable to that of the invention of the telescope itself and provide a truly revolutionary insight into the universe. The scientific case and the conceptual feasibility of giant filled aperture telescopes was our interested. Investigating the requirements of these imply for possible technical options in the case of a 100m telescope. For this telescope the considerable interest is the correction of the optical aberrations for the coming wavefront, th

... Show More