The concept of the order sum graph associated with a finite group based on the order of the group and order of group elements is introduced. Some of the properties and characteristics such as size, chromatic number, domination number, diameter, circumference, independence number, clique number, vertex connectivity, spectra, and Laplacian spectra of the order sum graph are determined. Characterizations of the order sum graph to be complete, perfect, etc. are also obtained.
Assume that G ≅ HN the Harada–Norton group. In this paper, effective investment for the graph ΓRI HN standard features to acquire meaningful algebraic results for the graph ΓRI HN and its corresponding group HN. For instance, marketing a modern methods to understand the way of create a precise small subgroups in G. Furthermore, performing a full investigation for getting particular ΓRI HN parameters.
In this work, a deep computational study has been conducted to assign several qualities for the graph . Furthermore, determine the amount of the dihedral subgroups in the Held simple group He through utilizing the attributes of gamma.
Dates are considered one of the most important foods consumed in Arab countries. Dates are commonly infested with the sawtoothed grain beetle, Oryzaephilus surinamensis. Consequently, the date yield, quantity, and quality (economic value and seed viability) are negatively affected. This study was designed to investigate the effectiveness of air evacuation as eco-friendly and safe control method against adult O. surinamensis. Insects were obtained from the infested date purchased from a private store in sakaka city, Aljouf region, Saudi Arabia. Air evacuation (using a vacuum pump) and food deprivation were applied to O. surinamensis, and insect mortality was observed daily in comparison with the control group (a
... Show MoreA new definition of a graph called Pure graph of a ring denote Pur(R) was presented , where the vertices of the graph represent the elements of R such that there is an edge between the two vertices ???? and ???? if and only if ????=???????? ???????? ????=????????, denoted by pur(R) . In this work we studied some new properties of pur(R) finally we defined the complement of pur(R) and studied some of it is properties
In this study, a brand-new graph definition known Associate graph of a ring R denote Ass(R) is present, where the graph’s vertices stand in for R’s elements s.t, any two vertices α and β merage by an edge if and only if α = rβ and β = sα. In this paper, we investigated some new property of Ass (R) are studied., the complement of Ass (R) is finally defined and a few of its characteristics are researched.
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.
In 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 More