Let A ⊆ V(H) of any graph H, every node w of H be labeled using a set of numbers; , where d(w,v) denotes the distance between node w and the node v in H, known as its open A-distance pattern. A graph H is known as the open distance-pattern uniform (odpu)-graph, if there is a nonempty subset A ⊆V(H) together with  is the same for all . Here  is known as the open distance pattern uniform (odpu-) labeling of the graph H and A is known as an odpu-set of H. The minimum cardinality of vertices in any odpu-set of H, if it exists, will be known as the odpu-number of the graph H. This article gives a characterization of maximal outerplanar-odpu graphs. Also, it establishes that the possible odpu-number of an odpu-maximal outerplanar graph i

In this work, we study several features of the non-zero divisor graphs (ℵZD- graph) for the ring Zn of integer modulo n. For instance, the clique number, radius, girth, domination number, and the local clustering coefficient are determined. Furthermore, we present an algorithm that calculates the clique number and draws the non-zero divisor for the ring Zn.

The study aimed to recommend a new spectrophotometric-kinetic method for determination of carbamazepine (CABZ) in its pure form and pharmaceutical forms. The proposed procedure based on the coupling of CABZ with diazotized sulfanilic acid in basic medium to yield a colored azo dye. Factors affecting the reaction yield were studied and the conditions were optimized. The colored product was followed spectrophotometrically via monitoring its absorbance at 396 nm. Under the optimized conditions, two method (the initial rate and fixed time (10 minute)) were applied for constructing the calibration graphs. The graphs were linear in concentration ranges 2.0 to 18.0 µg.mL^-1 for both methods. The proposed was applied successfully in

Consider a simple graph   on vertices and edges together with a total  labeling . Then ρ is called total edge irregular labeling if there exists a one-to-one correspondence, say  defined by  for all  where  Also, the value  is said to be the edge weight of . The total edge irregularity strength of the graph G is indicated by  and is the least  for which G admits   edge irregular h-labeling.  In this article,   for some common graph families are examined. In addition, an open problem is solved affirmatively.

Symmetric cryptography forms the backbone of secure data communication and storage by relying on the strength and randomness of cryptographic keys. This increases complexity, enhances cryptographic systems' overall robustness, and is immune to various attacks. The present work proposes a hybrid model based on the Latin square matrix (LSM) and subtractive random number generator (SRNG) algorithms for producing random keys. The hybrid model enhances the security of the cipher key against different attacks and increases the degree of diffusion. Different key lengths can also be generated based on the algorithm without compromising security. It comprises two phases. The first phase generates a seed value that depends on producing a rand

Excessive torque and drag can be critical limitation during drilling highly deviated oil wells. Using the modeling is regarded as an invaluable process to assist in well planning and to predict and prevent drilling problems. Identify which problems lead to excessive torque and drag to prevent cost losses and equipment damage. Proper modeling data is highly important for knowing and prediction hole problems may occur due to torque and drag and select the best method to avoid these problems related to well bore and drill string. In this study, Torque and drag well plan program from landmark worldwide programming group (Halliburton Company) used to identify hole problems.one deviated well in Zubair oil fields named, ZB-250 selected for