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.
The main purpose of this paper is to study feebly open and feebly closed mappings and we proved several results about that by using some concepts of topological feebly open and feebly closed sets , semi open (- closed ) set , gs-(sg-) closed set and composition of mappings.
Suppose that
Facial emotion recognition finds many real applications in the daily life like human robot interaction, eLearning, healthcare, customer services etc. The task of facial emotion recognition is not easy due to the difficulty in determining the effective feature set that can recognize the emotion conveyed within the facial expression accurately. Graph mining techniques are exploited in this paper to solve facial emotion recognition problem. After determining positions of facial landmarks in face region, twelve different graphs are constructed using four facial components to serve as a source for sub-graphs mining stage using gSpan algorithm. In each group, the discriminative set of sub-graphs are selected and fed to Deep Belief Network (DBN) f
... Show MoreMaher Harbi's drawings have taken an aesthetic and artistic dimension that leads to creating an approach between what is religious and mundane, between religious and mundane, with the techniques of plastic art, and this is what led the researcher to address this topic and stand on the realistic controversy based on the religious and the secular. Accordingly, the researcher divided the subject of the research into four chapters. The first chapter (the methodological framework) dealt with the research problem, which is summarized in the following question: (What is the dialectic of the reality of Maher Harbi’s drawings between the religious and the secular?) Then the importance of the research manifested in shedding light on the deep str
... Show MoreIn this work, the study of corona domination in graphs is carried over which was initially proposed by G. Mahadevan et al. Let be a simple graph. A dominating set S of a graph is said to be a corona-dominating set if every vertex in is either a pendant vertex or a support vertex. The minimum cardinality among all corona-dominating sets is called the corona-domination number and is denoted by (i.e) . In this work, the exact value of the corona domination number for some specific types of graphs are given. Also, some results on the corona domination number for some classes of graphs are obtained and the method used in this paper is a well-known number theory concept with some modification this method can also be applied to obt
... Show MoreThe current study aims to examine the level of problems faced by university students in distance learning, in addition to identify the differences in these problems in terms of the availability of internet services, gender, college, GPA, interactions, academic cohort, and family economic status. The study sample consisted of (3172) students (57.3% females). The researchers developed a questionnaire with (32) items to measure distance learning problems in four areas: Psychological (9 items), academic (10 items), technological (7 items), and study environment (6 items). The responses are scored on a (5) point Likert Scale ranging from 1 (strongly disagree) to 5 (strongly agree). Means, standard deviations, and Multivariate Analysis of Vari
... Show More