Search

In the modern era of the chemical science, the chemical graph theory has contributed significantly to exploring the properties of the chemical compounds. Currently, the computation of the topological indices is one of the most active directions of the research in the area of the chemical graph theory. The main feature of the study of the topological indices is its its ability of predicting the various physio-chemical properties. In this article, we compute several degree-based topological indices for the caboxy-terminated dendritic macromolecule. We compute Harmonic index, atom-bond connectivity index, geometric arithmetic index, sum connectivity index, inverse sum index, symmetric division degree, and Zagreb indices for caboxy-terminated dendritic macromolecule. The obtained results have potential to predict biochemical properties such as viscosity, entropy, and boiling point.

Cubic fuzzy graphs (CFGs) offer greater utility as compared to interval-valued fuzzy graphs and fuzzy graphs due to their ability to represent the degree of membership for vertices and edges using both interval and fuzzy number forms. The significance of these concepts motivates us to analyze and interpret intricate networks, enabling more effective decision making and optimization in various domains, including transportation, social networks, trade networks, and communication systems. This paper introduces the concepts of vertex and edge connectivity in CFGs, along with discussions on partial cubic fuzzy cut nodes and partial cubic fuzzy edge cuts, and presents several related results with the help of some examples to enhance understanding. In addition, this paper introduces the idea of partial cubic α-strong and partial cubic δ-weak edges. An example is discussed to explain the motivation behind partial cubic α-strong edges. Moreover, it delves into the introduction of generalized vertex and edge connectivity in CFGs, along with generalized partial cubic fuzzy cut nodes and generalized partial cubic fuzzy edge cuts. Relevant results pertaining to these concepts are also discussed. As an application, the concept of generalized partial cubic fuzzy edge cuts is applied to identify regions that are most affected by trade deficits resulting from street crimes. Finally, the research findings are compared with the existing method to demonstrate their suitability and creativity. [ABSTRACT FROM AUTHOR]

In this paper, a new full-Newton step feasible interior-point method for convex quadratic programming is presented and analyzed. The idea behind this method is to replace the complementarity condition with a non-negative weight vector and use the algebraic equivalent transformation for the obtained equation. Under the selection of appropriate parameters, the quadratic rate of convergence of the new algorithm is established. In addition, the iteration complexity of the algorithm is obtained. Finally, some numerical results are presented to demonstrate the practical performance of the proposed algorithm. [ABSTRACT FROM AUTHOR]

An important development in geometric algebra in recent years is the new system known as point geometry, which treats points as direct objects of operations and considerably simplifies the process of geometric reasoning. In this paper, we provide a complete formal description of the point geometry theory architecture and give a rigorous and reliable formal verification of the point geometry theory based on the theorem prover Coq. Simultaneously, a series of tactics are also designed to assist in the proof of geometric propositions. Based on the theoretical architecture and proof tactics, a universal and scalable interactive point geometry machine proof system, PointGeo, is built. In this system, any arbitrary point-geometry-solvable geometric statement may be proven, along with readable information about the solution's procedure. Additionally, users may augment the rule base by adding trustworthy rules as needed for certain issues. The implementation of the system expands the library of Coq resources on geometric algebra, which will become a significant research foundation for the fields of geometric algebra, computer science, mathematics education, and other related fields. [ABSTRACT FROM AUTHOR]

Let S (m , e) be a class of numerical semigroups with multiplicity m and embedding dimension e. We call a graph G S an S (m , e) -graph if there exists a numerical semigroup S ∈ S (m , e) with V (G S) = { x : x ∈ g (S) } and E (G S) = { x y ⇔ x + y ∈ S } , where g (S) denotes the gap set of S. The aim of this article is to discuss the planarity of S (m , e) -graphs for some cases where S is an irreducible numerical semigroup. [ABSTRACT FROM AUTHOR]

The concept of convex ordered hyperrings associated with a strongly regular relation was investigated in this study. In this paper, we first studied hyperatom elements of ordered hyperrings and then investigated characterizations of quotient ordered rings. Is there a strongly regular relation θ on a convex ordered hyperring R for which R / θ is a convex ordered ring? This leads to an ordered ring obtained from an ordered hyperring. [ABSTRACT FROM AUTHOR]

We give some conditions on ordered Γ -semihypergroups under which their interior hyperideal is equal to the hyperideal. In this paper, it is shown that in regular (resp., intraregular, semisimple) ordered Γ -semihypergroups, the hyperideals and the interior hyperideals coincide. To show the importance of these results, some examples and conclusions are provided. [ABSTRACT FROM AUTHOR]

The main purpose of this paper is to study fundamental properties of weak Γ -hyperfilters on ordered Γ -semihypergroups that is a generalization of Γ -hyperfilters. Also, we investigate the relationship between weak Γ -hyperfilters and prime Γ -hyperideals in ordered Γ -semihypergroups. Finally, we introduce weak m , n - Γ -hyperfilters of ordered Γ -semihypergroups and conclude in paper with arising explicit theorems. [ABSTRACT FROM AUTHOR]