Preferred Language
Articles
/
ahbtBYcBVTCNdQwCQC8s
Strongly Connected Ramanujan Graphs for Highly Symmetric LDPC Codes
...Show More Authors

Scopus Clarivate Crossref
View Publication
Publication Date
Thu Dec 08 2022
Journal Name
Aequationes Mathematicae
On graceful antimagic graphs
...Show More Authors

View Publication
Scopus (4)
Crossref (2)
Scopus Clarivate Crossref
Publication Date
Sun Mar 17 2019
Journal Name
Baghdad Science Journal
Hn-Domination in Graphs
...Show More Authors

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.

View Publication Preview PDF
Scopus (53)
Crossref (5)
Scopus Clarivate Crossref
Publication Date
Wed May 27 2020
Journal Name
Research Gate
Information Booklet COVID-19 Graphs For Iraq First 3 Months
...Show More Authors

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].

Preview PDF
Publication Date
Sun May 16 2021
Journal Name
Graphs And Combinatorics
Commuting Involution Graphs for Certain Exceptional Groups of Lie Type
...Show More Authors
Abstract<p>Suppose that <italic>G</italic> is a finite group and <italic>X</italic> is a <italic>G</italic>-conjugacy classes of involutions. The commuting involution graph <inline-formula><alternatives><tex-math>$${\mathcal {C}}(G,X)$$</tex-math><math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mrow> <mi>C</mi> <mo>(</mo> <mi>G</mi> <mo>,</mo> <mi>X</mi> <mo>)</mo> </mrow> </math></alternatives></inline-formula> is</p> ... Show More
View Publication
Scopus (7)
Crossref (3)
Scopus Clarivate Crossref
Publication Date
Sun Jun 20 2021
Journal Name
Baghdad Science Journal
Projective MDS Codes Over GF(27)‎
...Show More Authors

MDS code is a linear code that achieves equality in the Singleton bound, and projective MDS (PG-MDS) is MDS code with independents property of any two columns of its generator matrix.   In this paper, elementary methods for modifying a PG-MDS code of dimensions 2, 3, as extending and lengthening, in order to find new incomplete PG-MDS codes have been used over . Also, two complete PG-MDS codes over  of length  and 28 have been found.

View Publication Preview PDF
Scopus (9)
Crossref (2)
Scopus Clarivate Crossref
Publication Date
Tue Dec 01 2020
Journal Name
Baghdad Science Journal
Emergency Messages Dissemination Challenges Through Connected Vehicles for Efficient Intelligent Transportation Systems: A Review
...Show More Authors

Recent growth in transport and wireless communication technologies has aided the evolution of Intelligent Transportation Systems (ITS). The ITS is based on different types of transportation modes like road, rail, ocean and aviation. Vehicular ad hoc network (VANET) is a technology that considers moving vehicles as nodes in a network to create a wireless communication network. VANET has emerged as a resourceful approach to enhance the road safety. Road safety has become a critical issue in recent years. Emergency incidents such as accidents, heavy traffic and road damages are the main causes of the inefficiency of the traffic flow. These occurrences do not only create the congestion on the road but also increase the fuel consumption and p

... Show More
View Publication Preview PDF
Scopus (5)
Crossref (4)
Scopus Clarivate Crossref
Publication Date
Mon Aug 01 2011
Journal Name
Journal Of Engineering
LDPC CODED MULTIUSER MC-CDMA PERFORMANCE OVERMULTIPATH RAYLEIGH FADING CHANNEL
...Show More Authors

This work presents the simulation of a Low density Parity Check (LDPC) coding scheme with
multiuserMulti-Carrier Code Division Multiple Access (MC-CDMA) system over Additive White
Gaussian Noise (AWGN) channel and multipath fading channels. The decoding technique used in
the simulation was iterative decoding since it gives maximum efficiency with ten iterations.
Modulation schemes that used are Phase Shift Keying (BPSK, QPSK and 16 PSK), along with the
Orthogonal Frequency Division Multiplexing (OFDM). A 12 pilot carrier were used in the estimator
to compensate channel effect. The channel model used is Long Term Evolution (LTE) channel with
Technical Specification TS 25.101v2.10 and 5 MHz bandwidth including the chan

... Show More
View Publication Preview PDF
Crossref
Publication Date
Sat Jan 01 2011
Journal Name
Al- Mustansiriya J. Sci
Rationally Extending Modules and Strongly Quasi-Monoform Modules
...Show More Authors

An R-module M is called rationally extending if each submodule of M is rational in a direct summand of M. In this paper we study this class of modules which is contained in the class of extending modules, Also we consider the class of strongly quasi-monoform modules, an R-module M is called strongly quasi-monoform if every nonzero proper submodule of M is quasi-invertible relative to some direct summand of M. Conditions are investigated to identify between these classes. Several properties are considered for such modules

View Publication Preview PDF
Publication Date
Mon Jan 28 2019
Journal Name
Soft Computing
Bio-inspired multi-objective algorithms for connected set K-covers problem in wireless sensor networks
...Show More Authors

Scopus (13)
Crossref (12)
Scopus Clarivate Crossref
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
...Show More Authors

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 (4)
Crossref (1)
Scopus Clarivate Crossref