In this paper, a new idea to configure a special graph from the discrete topological space is given. Several properties and bounds of this topological graph are introduced. Such that if the order of the non-empty set equals two, then the topological graph is isomorphic to the complete graph. If the order equals three, then the topological graph is isomorphic to the complement of the cycle graph. Our topological graph has complete induced subgraphs with order or more. It also has a cycle subgraph. In addition, the clique number is obtained. The topological graph is proved simple, undirected, connected graph. It has no pendant vertex, no isolated vertex and no cut vertex. The minimum and maximum degrees are evaluated. So , the radius and diameter are studied here.
Several new copolymer containing imides were prepared from the corresponding
copolymers containing amic acids using dehydrating agent such as acetyl chloride –
tri ethyl amine mixture. The obtained yields were different ranging from 65% to
80%. Readily polymerized unsaturated copolymers containing imides free radically
using azobisisobuty ronitrile (AIBN) as initiator to yield high molecular weight
copolymers. All the prepared resins were characterized IR. NMR. Elemental
analysis. TG and DTG Techniques.
Recent years have seen an explosion in graph data from a variety of scientific, social and technological fields. From these fields, emotion recognition is an interesting research area because it finds many applications in real life such as in effective social robotics to increase the interactivity of the robot with human, driver safety during driving, pain monitoring during surgery etc. A novel facial emotion recognition based on graph mining has been proposed in this paper to make a paradigm shift in the way of representing the face region, where the face region is represented as a graph of nodes and edges and the gSpan frequent sub-graphs mining algorithm is used to find the frequent sub-structures in the graph database of each emotion. T
... Show MoreThe importance of topology as a tool in preference theory is what motivates this study in which we characterize topologies generating by digraphs. In this paper, we generalized the notions of rough set concepts using two topological structures generated by out (resp. in)-degree sets of vertices on general digraph. New types of topological rough sets are initiated and studied using new types of topological sets. Some properties of topological rough approximations are studied by many propositions.
I attended some amides non grassy substitutes such as acrylic compounds Amaid Electron Amaid and Alsinamamaid interaction unsaturated acids such as acrylic acid or Ketronk ????????? with primary amines Malkhtlfah of acrylic monomers Alamayd
In this paper, we introduced some new definitions on P-compact topological ring and PL-compact topological ring for the compactification in topological space and rings, we obtain some results related to P-compact and P-L compact topological ring.
In 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.
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.
The concept of fuzzy orbit open sets under the mapping
We introduce and discuss the modern type of fibrewise topological spaces, namely fibrewise fuzzy topological spaces. Also, we introduce the concepts of fibrewise closed fuzzy topological spaces, fibrewise open fuzzy topological spaces, fibrewise locally sliceable fuzzy topological spaces and fibrewise locally sectionable fuzzy topological spaces. Furthermore, we state and prove several theorems concerning these concepts.
Fibrewise topological spaces theory is a relatively new branch of mathematics, less than three decades old, arisen from algebraic topology. It is a highly useful tool and played a pivotal role in homotopy theory. Fibrewise topological spaces theory has a broad range of applications in many sorts of mathematical study such as Lie groups, differential geometry and dynamical systems theory. Moreover, one of the main objects, which is considered in fibrewise topological spaces theory is connectedness. In this regard, we of the present study introduce the concept of connected fibrewise topological spaces and study their main results.