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 paper is to generate topological structure on the power set of vertices of digraphs using new definition which is Gm-closure operator on out-linked of digraphs. Properties of this topological structure are studied and several examples are given. Also we give some new generalizations of some definitions in digraphs to the some known definitions in topology which are Ropen subgraph, α-open subgraph, pre-open subgraph, and β-open subgraph. Furthermore, we define and study the accuracy of these new generalizations on subgraps and paths.

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.

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

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

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