The concept of weak UP-algebras (shortly wUP-algebra) is an extension of the notion of UP-algebras introduced in 2021 by Iampan and Romano. In this report, an effective extension of a (weak) UP-algebra to a wUP-algebra is created. In addition to the previous one, the concept of atoms in wUP-algebras is introduced and their important properties are registered. Finally, the concept of wUP-filters in wUP-algebras was introduced and its connections with other substructures in wUP-algebras were analyzed.

In normed spaces, Birkhoff orthogonality and isosceles orthogonality can be used to characterize space structures, and many scholars have introduced geometric constants to quantitatively describe the relationship between these two types of orthogonality. This paper introduces a new orthogonal relationship – Skew orthogonality – and proposes a new geometric constant to measure the “distance” of difference between skew orthogonality and Birkhoff orthogonality in normed spaces. In the end, we provide some examples of specific spaces.

Entropy patterns typically transfer actions of two-state relations in nonlinear systems. Here, multivalent logic is applied from autowave fields to selected Quantum Neurophysical systems.

This study investigates contemporary and emerging transportation problems in North-central Nigeria. Its primary objective is to identify and characterize the major challenges facing passengers within the region and to propose a sustainable institutional framework for improved transportation management. The study draws upon data collected through field audits in three North-central states: the Federal Capital Territory (FCT) Abuja, Nasarawa, and Niger. Key findings highlight the lack of developed transit connections to major activity centers. The study concludes that these challenges stem from inefficiencies within the existing institutional mechanisms for transportation management. To address this, the study proposes the establishment of an effective, innovative transport system, such as an intercity train network within the North-central zone, as a sustainable transportation management strategy for the region.

The purpose of this paper is to introduce and evaluate novel iterative methods for approximating solutions to nonlinear equations, which leverage the power of the variational iteration technique. Specifically, we present a comprehensive analysis of the proposed methods and demonstrate their effectiveness through various examples. Moreover, we provide a comparative analysis with other existing methods and conclude that the newly developed methods offer a competitive alternative. Our results highlight the potential of this approach in generating a diverse set of iterative methods for solving nonlinear equations. Therefore, this study contributes to the ongoing efforts to improve the efficiency and accuracy of nonlinear equation solving techniques.

There are three different kinds of topological indices: spectrum-based, degree-based, and distance-based. We presented the \(K\)-swapped network for \(t\)-regular graphs in this study. We also computed various degree-based topological indices of the \(K\)-swapped network for \(t\)-regular graphs, eye, and \(n\)-dimensional twisted cube network. The metrics used to analyze the abstract structural characteristics of networks are called topological indices. We also calculate each of the aforementioned networks M-polynomials. A graph can be used to depict an interconnection network’s structure. The processing nodes in the network are represented by vertices, while the links connecting the processor nodes are represented by edges. We can quickly determine the diameter and degree between the nodes based on the graph’s tpology. A key component of graph theory are graph invariants, which identify the structural characteristics of networks and graphs. Furthermore doescribed by graph invariants are computer, social, and internet networks.

Shadi I.K et al. [1] introduced the edge hub number of graphs. This work extends the concept to fuzzy graphs. We derive several properties of edge hub number of fuzzy graphs and establish some relations that connect the new parameter with other fuzzy graph parameters. Also, some bounds of such a parameter are investigated. Moreover, we provide empirical evidence examples to elucidate the behavior and implications of edge hub number of fuzzy graph parameters.

In this paper, we give a relationship between the covering number of a simple graph \(G\), \(\beta(G)\), and a new parameter associated to \(G\), which is called 2-degree-packing number of \(G\), \(\nu_2(G)\). We prove that \[\lceil \nu_{2}(G)/2\rceil\leq\beta(G)\leq\nu_2(G)-1,\] for any simple graph \(G\), with \(|E(G)|>\nu_2(G)\). Also, we give a characterization of connected graphs that attain the equalities.

Let \(A\) and \(B\) be two graph and \(P(A,z)\) and \(P(B,z)\) are their chromatic polynomial, respectively. The two graphs \(A\) and \(B\) are said to be chromatic equivalent denoted by \( A \sim B \) if \(P(A,z)=P(B,z)\). A graph \(A\) is said to be chromatically unique(or simply \(\chi\)- unique) if for any graph \(B\) such that \(A\sim B \), we have \(A\cong B\), that is \(A\) is isomorphic to \(B\). In this paper, the chromatic uniqueness of a new family of \(6\)-bridge graph \(\theta(r,r,s,s,t,u)\) where \(2\leq r\leq s \leq t\leq u\) is investigated.

This corrigenda makes seven corrections to D. Raske, “The Galerkin method and hinged beam dynamics,” Open J. of Math. Sci. 2023, 7, 236-247.