Recently, complementary perfect corona domination in graphs was introduced. A dominating set S of a graph G is said to be a complementary perfect corona dominating set (CPCD – set) if each vertex in is either a pendent vertex or a support vertex and has a perfect matching. The minimum cardinality of a complementary perfect corona dominating set is called the complementary perfect corona domination number and is denoted by . In this paper, our parameter hasbeen discussed for power graphs of path and cycle.
This paper deals with the determination of stresses and deflections of clamped circular diaphragm strengthened by one or two ring-shaped concentric ribs, under uniform static and dynamic pressures. The simulation has been achieved by using the well-known engineering software finite element package MSC/NASTRAN.
As a design study, the effect of using a clamped ring, and the effect of using a ring-shaped rib on both surfaces of diaphragm instead of one, has been discussed in this work. To show the effectiveness of this study, results of this work have been compared with published data [1].
In the conclusion, the authors underline the validity of the&n
... Show MoreIn this thesis, we study the topological structure in graph theory and various related results. Chapter one, contains fundamental concept of topology and basic definitions about near open sets and give an account of uncertainty rough sets theories also, we introduce the concepts of graph theory. Chapter two, deals with main concepts concerning topological structures using mixed degree systems in graph theory, which is M-space by using the mixed degree systems. In addition, the m-derived graphs, m-open graphs, m-closed graphs, m-interior operators, m-closure operators and M-subspace are defined and studied. In chapter three we study supra-approximation spaces using mixed degree systems and primary object in this chapter are two topological
... Show MoreResearchers dream of developing autonomous humanoid robots which behave/walk like a human being. Biped robots, although complex, have the greatest potential for use in human-centred environments such as the home or office. Studying biped robots is also important for understanding human locomotion and improving control strategies for prosthetic and orthotic limbs. Control systems of humans walking in cluttered environments are complex, however, and may involve multiple local controllers and commands from the cerebellum. Although biped robots have been of interest over the last four decades, no unified stability/balance criterion adopted for stabilization of miscellaneous walking/running modes of biped
Anomaly detection is still a difficult task. To address this problem, we propose to strengthen DBSCAN algorithm for the data by converting all data to the graph concept frame (CFG). As is well known that the work DBSCAN method used to compile the data set belong to the same species in a while it will be considered in the external behavior of the cluster as a noise or anomalies. It can detect anomalies by DBSCAN algorithm can detect abnormal points that are far from certain set threshold (extremism). However, the abnormalities are not those cases, abnormal and unusual or far from a specific group, There is a type of data that is do not happen repeatedly, but are considered abnormal for the group of known. The analysis showed DBSCAN using the
... Show MoreLet be a non-trivial simple graph. A dominating set in a graph is a set of vertices such that every vertex not in the set is adjacent to at least one vertex in the set. A subset is a minimum neighborhood dominating set if is a dominating set and if for every holds. The minimum cardinality of the minimum neighborhood dominating set of a graph is called as minimum neighborhood dominating number and it is denoted by . A minimum neighborhood dominating set is a dominating set where the intersection of the neighborhoods of all vertices in the set is as small as possible, (i.e., ). The minimum neighborhood dominating number, denoted by , is the minimum cardinality of a minimum neighborhood dominating set. In other words, it is the
... Show MoreA general velocity profile for a laminar flow over a flat plate with zero incidence is obtained by employing a new boundary condition to the other available boundary conditions. The general velocity profile is mathematically simple and nearest to the exact solution. Also other related values, boundary layer thickness, displacement thickness, momentum thickness and coefficient of friction are nearest to the exact solution compared with other corresponding values for other researchers.
A general velocity profile for a laminar flow over a flat plate with zero incidence is obtained by employing a new boundary condition to the other available boundary conditions. The general velocity profile is mathematically simple and nearest to the exact solution. Also other related values, boundary layer thickness, displacement thickness, momentum thickness and coefficient of friction are nearest to the exact solution compared with other corresponding values for other researchers.
Let R be a commutative ring , the pseudo – von neuman regular graph of the ring R is define as a graph whose vertex set consists of all elements of R and any two distinct vertices a and b are adjacent if and only if , this graph denoted by P-VG(R) , in this work we got some new results a bout chromatic number of P-VG(R).
Abstract The Synthesis in good yields of some new 1,8-Naphthyridine derivatives (1-9) and characterized on the basis of IR and 1H NMR spectra data. The compounds (1) and (6) were utilized as a starting material for the preparing of these compounds.