. 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 .
The main objective of this research is to study and to introduce a concept of strong fully stable Banach -algebra modules related to an ideal.. Some properties and characterizations of full stability are studied.
This paper discusses reliability of the stress-strength model. The reliability functions ð‘…1 and ð‘…2 were obtained for a component which has an independent strength and is exposed to two and three stresses, respectively. We used the generalized inverted Kumaraswamy distribution GIKD with unknown shape parameter as well as known shape and scale parameters. The parameters were estimated from the stress- strength models, while the reliabilities ð‘…1, ð‘…2 were estimated by three methods, namely the Maximum Likelihood, Least Square, and Regression.
A numerical simulation study a comparison between the three estimators by mean square error is performed. It is found that best estimator between
... Show MoreThe recent developments in information technology have made major changes in all fields. The transfer of information through networks has become irreplaceable due to its advantages in facilitating the requirements of modern life through developing methods of storing and distributing information. This in turn has led to an increase in information problems and risks that threaten the security of the institution’s information and can be used in distributed systems environment.
This study focused on two parts; the first is to review the most important applications of the graph theory in the field of network security, and the second is focused on the possibility of using the Euler graph as a Method Object that is employed in Re
... Show MoreAdvances in digital technology and the World Wide Web has led to the increase of digital documents that are used for various purposes such as publishing and digital library. This phenomenon raises awareness for the requirement of effective techniques that can help during the search and retrieval of text. One of the most needed tasks is clustering, which categorizes documents automatically into meaningful groups. Clustering is an important task in data mining and machine learning. The accuracy of clustering depends tightly on the selection of the text representation method. Traditional methods of text representation model documents as bags of words using term-frequency index document frequency (TFIDF). This method ignores the relationship an
... Show MoreIn This paper, we introduce the associated graphs of commutative KU-algebra. Firstly, we define the KU-graph which is determined by all the elements of commutative KU-algebra as vertices. Secondly, the graph of equivalence classes of commutative KU-algebra is studied and several examples are presented. Also, by using the definition of graph folding, we prove that the graph of equivalence classes and the graph folding of commutative KU-algebra are the same, where the graph is complete bipartite graph.
In the present paper, we will study the generalized ( p, q) -type and
generalized lower ( p, q) -type of an entire function in several complex
variables with respect to the proximate order with index pair ( p, q) are
defined and their coefficient characterizations are obtained.
Data security is an important component of data communication and transmission systems. Its main role is to keep sensitive information safe and integrated from the sender to the receiver. The proposed system aims to secure text messages through two security principles encryption and steganography. The system produced a novel method for encryption using graph theory properties; it formed a graph from a password to generate an encryption key as a weight matrix of that graph and invested the Least Significant Bit (LSB) method for hiding the encrypted message in a colored image within a green component. Practical experiments of (perceptibility, capacity, and robustness) were calculated using similarity measures like PSNR, MSE, and
... Show MoreThe significance of the work is to introduce the new class of open sets, which is said Ǥ- -open set with some of properties. Then clarify how to calculate the boundary area for these sets using the upper and lower approximation and obtain the best accuracy.
This paper deal with the estimation of the shape parameter (a) of Generalized Exponential (GE) distribution when the scale parameter (l) is known via preliminary test single stage shrinkage estimator (SSSE) when a prior knowledge (a0) a vailable about the shape parameter as initial value due past experiences as well as suitable region (R) for testing this prior knowledge.
The Expression for the Bias, Mean squared error [MSE] and Relative Efficiency [R.Eff(×)] for the proposed estimator are derived. Numerical results about beha
... Show More