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 is either two or five only.
A graph is a structure amounting to a set of objects in which some pairs of the objects are in some sense related. The objects correspond to mathematical abstractions called vertices (also called nodes or points) and each of the related pairs of vertices is called an edge (also called link or line). A directed graph is a graph in which edges have orientation. A simple graph is a graph that does not have more than one edge between any two vertices and no edge starts and ends at the same vertex. For a simple undirected graph G with order n, and let denotes its complement. Let δ(G), ∆(G) denotes the minimum degree and maximum degree of G respectively. The complement degree polynomial of G is the polynomial CD[G,x]= , where C
... Show MoreRice (Oryza sativa) is a fundamental food for the majority of world population. Cyclin Dependent Kinase -A (CDKA) accelerates transition through different stages of cell cycle and contributes in gametes formation. In the present investigation, a CDKA encoding gene along with the corresponding protein were characterized in O. sativa Indica Group, O. glaberrima, O. barthii, O. brachyantha, O. glumipatula, O. longistaminata, O. meridionalis, O. nivara, O. punctata and O. rufipogon using in silico analyses. The results reflected little variation in most species except O. longistaminata and O. brachyantha. Compared with the remaining species, O. longistaminata
... Show MoreThe present study focused mainly on the buckling behavior of composite laminated plates subjected to mechanical loads. Mechanical loads are analyzed by experimental analysis, analytical analysis (for laminates without cutouts) and numerical analysis by finite element method (for laminates with and without cutouts) for different type of loads which could be uniform or non-uniform, uniaxial or biaxial. In addition to many design parameters of the laminates such as aspect ratio, thickness ratio, and lamination angle or the parameters of the cutout such as shape, size, position, direction, and radii rounding) which are changed to studytheir effects on the buckling characteristics with various boundary conditions. Levy method of classical lam
... Show MoreA total global dominator coloring of a graph is a proper vertex coloring of with respect to which every vertex in dominates a color class, not containing and does not dominate another color class. The minimum number of colors required in such a coloring of is called the total global dominator chromatic number, denoted by . In this paper, the total global dominator chromatic number of trees and unicyclic graphs are explored.
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 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.
The emergence of staphylococci, either coagulase negative (CNS) or coagulase positive (CPS), as important human pathogens has implied that reliable methods for their identification are of large significance in understanding the diseases caused by them. The identification and characterization of staphylococci from biopsies taken from human breast tumors is reported here. Out of 32 tissue biopsies, a total of 12 suspected staphylococci grew on mannitol salt agar (MSA) medium, including 7 fermenters and 5 non-fermenter staphylococci based on traditional laboratory methods. Polymerase chain reaction (PCR) successfully identified seven isolates at the genus level as methicillin resistant St
... Show MoreThe problem of present study is determined by answering the following questions:
1) What is the effect of using the oral open- ended questions on Students' achievement in the third-stage of Arabic department in the college of Education? 2) What is the effect of the oral open-ended questions on developing the creative thinking of students in
... Show MoreThe object of this research is to determine the effect in the differences of the correlation pattern of the micro blogging on the educational attainment of computer science curriculum for 12th grade students. I will try to test the best suited correlation and I might use the demo curriculum as well to achieve its objectives , The research method that will be used in this research is the quantitative method where we will use a sample of 60 students divided into two groups ( correlate the micro blogging - adopted the sequence pattern of relating the micro blogging) As a result, we found out that there are quantitative differences among the two groups' median , The differences goes back to the main effect of the correlation pattern of the m
... Show MoreThe 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.