This paper proposes the concept of direct product of fuzzy multigroups under \(t\)-norms and some of their basic properties are obtained. Next, we investigate and obtain some new results of strong upper alpha-cut, weak upper alpha-cut, strong lower alpha-cut and weak lower alpha-cut of them. Later, we prove conjugation and commutation between them. Finally, the notion of homomorphism in the context of fuzzy multigroups was defined and some homomorphic properties of fuzzy multigroups under \(t\)-norms in terms of homomorphic images and homomorphic preimages, respectively, were presented.
The concept of fuzzy set theory is of paramount relevance to tackling the issues of uncertainties in real-life problems. In a quest to having a reasonable means of curbing imprecision, the idea of fuzzy sets had been generalized to intuitionistic fuzzy sets, fuzzy multisets, Pythagorean fuzzy sets among others. The notion of intuitionistic fuzzy multisets (IFMS) came into the limelight naturally because there are instances when repetitions of both membership and non-membership degrees cannot be ignored like in the treatment of patients, where each consultations are key in diagnosis and therapy. In IFMS theory, the sum of the degrees of membership and non-membership is less than or equals one at each levels. Supposing the sum of the degrees of membership and non-membership is greater than or equal to one at any level, then the concept of Pythagorean fuzzy multisets (PFMS) is appropriate to handling such scenario. In this paper, the idea of PFMS is proposed as an extensional Pythagorean fuzzy sets proposed by R. R. Yager. In fact, PFMS is a Pythagorean fuzzy set in the framework of multiset. The main objectives of this paper are to expatiate the operations under PFMSs and discuss some of their algebraic properties with some related results. The concepts of level sets, cuts, accuracy and score functions, and modal operators are established in the setting of PFMSs with a number of results. Finally, to demonstrate the applicability of the proposed soft computing technique, a course placements scenario is discussed via PFMS framework using composite relation defined on PFMSs. This soft computing technique could find expression in other multi-criteria decision-making (MCDM) problems.
Capacitated vehicle routing problem is one of the variants of the vehicle routing problem which was studied in this research. In this research we applied a reinforcement learning algorithm to find set of routes from a depot to the set of customers while also considering the capacity of the vehicles, in order to reduce the cost of transportation of goods and services. Each vehicle originates from a depot, service the customers and return to the depot. We compare the reinforcement learning model with an exact method; column generation and Google’s OR-tool. Our objective is to solve a large-size of problem to near-optimality. We were able to use reinforcement learning to solve upto 101 nodes to near-optimality.
In this paper, we establish a connection between differential operators and Narayana numbers of both kinds, as well as a kind of numbers related to central binomial coefficients studied by Sulanke (Electron. J. Combin. 7 (2000), R40).
The Wiener index is a topological index of a molecule, defined as the sum of distances between all pairs of vertices in the chemical graph. Hexagonal chains consist of hexagonal rings connected with each other by edges. This class of chains contains molecular graphs of unbranched catacondensed benzenoid hydrocarbons. A segment of length \(\ell\) of a chain is its maximal subchain with \(\ell\) linear annelated hexagons. We consider chains in which all segments have equal lengths. Such chains can be uniquely represented by binary vectors. The Wiener index of hexagonal chains under some operations on the corresponding binary vectors are investigated. The obtained results may be useful in studying of topological indices for sets of hexagonal chains induced by algebraic constructions.
For every \(n\ge 3\), we determine the minimum number of edges of graph with \(n\) vertices such that for any non edge \(xy\) there exits a hamiltonian cycle containing \(xy\).
In this paper, the approach to obtaining nontrivial formulas for some recursively defined sequences is illustrated. The most interesting result in the paper is the formula for the solution of quadratic map-like recurrence. Also, some formulas for the solutions of linear difference equations with variable coefficients are obtained. At the end of the paper, some integer sequences associated with a quadratic map are considered.
For a given graph, let \(w_k\) denote the number of its walks with \(k\) vertices and let \(\lambda_1\) denote the spectral radius of its adjacency matrix. Nikiforov asked in [Linear Algebra Appl 418 (2006), 257–268] whether it is true in a connected bipartite graph that \(\lambda_1^r\geq\frac{w_{s+r}}{w_s}\) for every even \(s\geq 2\) and even \(r\geq 2\)? We construct here several infinite sequences of connected bipartite graphs with two main eigenvalues for which the ratio \(\frac{w_{s+r}}{\lambda_1^r w_s}\) is larger than~1 for every even \(s,r\geq 2\), and thus provide a negative answer to the above problem.
In a simple connected graph \(G\), eccentricity of a vertex is one of the first, distance-based invariants. The eccentricity of a vertex \(v\) in a connected graph \(G\) is the maximum distance of the vertex \(v\) to any other vertex \(u\). The total eccentricity of the graph \(G\) is the sum of the all vertex eccentricities. A graph \(G\) is called an apex tree if it has a vertex \(x\) such that \(G-x\) is a tree. In this work we have found the graph having extremal total eccentricity of \(k\)-apex trees.
In this paper, we obtained some new properties of Zagreb indices. We mainly give explicit formulas to the second Zagreb index of semitotal-line graph (or middle graph), semitotal-point graph and total transformation graphs \(G^{xyz}.\)
