We consider the canonical ensemble of N-vertex Erdős-Rényi (ER) random topological graphs with quenched vertex degree, and with fugacity μ for each closed triple of bonds. We claim complete defragmentation of la...
详细信息
We consider the canonical ensemble of N-vertex Erdős-Rényi (ER) random topological graphs with quenched vertex degree, and with fugacity μ for each closed triple of bonds. We claim complete defragmentation of large-N graphs into the collection of [p−1] almost full subgraphs (cliques) above critical fugacity, μc, where p is the ER bond formation probability. Evolution of the spectral density, ρ(λ), of the adjacency matrix with increasing μ leads to the formation of a multizonal support for μ>μc. Eigenvalue tunneling from the central zone to the side one means formation of a new clique in the defragmentation process. The adjacency matrix of the network ground state has a block-diagonal form, where the number of vertices in blocks fluctuates around the mean value Np. The spectral density of the whole network in this regime has triangular shape. We interpret the phenomena from the viewpoint of the conventional random matrix model and speculate about possible physical applications.
This paper explores the study of multi-choice multi-objective transportation problem (MCMTP) under the environment of utility function approach. MCMTP is converted to multi-objective transportation problems (MOTP) by ...
This paper explores the study of multi-choice multi-objective transportation problem (MCMTP) under the environment of utility function approach. MCMTP is converted to multi-objective transportation problems (MOTP) by transforming the multi-choice parameters like cost, demand, and supply to real-valued parameters. A general transformation procedure using binary variables is illustrated to reduce MCMTP into MOTP. Most of the MOTP are solved by goal programming (GP) approach. Using GP, the solution of MOTP may not be satisfied all the time by the decision maker (DM) when the proposed problem contains interval-valued aspiration level. To overcome this difficulty, here we propose the approaches of revised multi-choice goal programming (RMCGP) and utility function into the MOTP and then compared the solution between them. Finally, numerical examples are presented to show the feasibility and usefulness of our paper.
This article focuses on an imperfect production inventory model considering product reliability and reworking of imperfect items in three-layer supply chain under fuzzy rough environment. In the model, the supplier re...
This article focuses on an imperfect production inventory model considering product reliability and reworking of imperfect items in three-layer supply chain under fuzzy rough environment. In the model, the supplier receives the raw materials, all are not of perfect quality, in a lot and delivers the items of superior quality to the manufacturer and the inferior quality items are sold at a reduced price in a single batch by the end of the cent percent screening process. The manufacturer produces a mixture of perfect and imperfect quality items. A portion of the imperfect items is transformed into perfect quality items after rework. Another portion of imperfect items, termed as `less perfect quality items', is sold at a reduced price to the retailer, and the portion which cannot be either transformed to the perfect quality items or sold at a reduce price is being rejected. Here, retailer purchases both the perfect and imperfect quality items from the manufacturer to sell the items to the customers through his/her respective showrooms of finite capacities. A secondary warehouse of infinite capacity is hired by the retailer on rental basis to store the excess quantity of perfect quality items. This model considers the impact of business strategies such as optimal order size of raw materials, production rate, and unit production cost in different sectors in a collaborating marketing system that can be used in the industry, like textile, footwear, and electronics goods. An analytical method has been used to optimize the production rate and raw material order size for maximization of the average profit of the integrated model. Finally, a numerical example is given to illustrate the model.
The aim of this article is to present a fuzzy programming approach to a singlesink, fixed-charge, multiobjective, multi-index stochastic transportation problem (SSMISTP). This article focuses on the minimization of th...
详细信息
Presently, fuzzy graph theory has wide applications in engineering and social networks. Based on the applications, different types of fuzzy graphs are defined. Among them the competition graph is significantly used to...
Presently, fuzzy graph theory has wide applications in engineering and social networks. Based on the applications, different types of fuzzy graphs are defined. Among them the competition graph is significantly used to model ecological problems. This graph is one kind of intersection graph. Different competitions of real world have been designed by fuzzy competition graphs. One generalization of fuzzy competition graph, called $$m$$ -step fuzzy competition graph, is defined in this paper. Some related fuzzy graphs including fuzzy $$m$$ -step neighbourhood graph, fuzzy economic competition graphs and fuzzy $$m$$ -step economic competition graphs are introduced. Some properties of these new graphs have been investigated.
Visual Cryptography (VC) is a technique to encrypt a secret image into transparent shares such that stacking a sufficient number of shares reveals the secret image without any computation. Cheating is possible in the ...
详细信息
Visual Cryptography (VC) is a technique to encrypt a secret image into transparent shares such that stacking a sufficient number of shares reveals the secret image without any computation. Cheating is possible in the Visual Cryptographic Schemes (VCS) by dishonest or malicious participant called a cheater, may provide a Fake Share (FS) to cheat the other participants. To achieve cheating prevention in VC we have proposed a steganographic scheme to embed a secret message in each of the shares in random location during share generation phase called stego share. Before stacking receiver can extract hidden message from stego share for checking authentication of shares. In this method no verification share is required to prevent cheating in VC.
Fuzzy competition graph as the generalization of competition graph is introduced here. A generalization of fuzzy competition graph known as fuzzy k-competition graph is also defined. These graphs are related to fuzzy ...
详细信息
The optimal production and advertising policies for an inventory control system of multi-item multiobjective problem under a single management are formulated as an optimal control problem with resource constraints und...
Fuzzy graph is now a very important research area due to its wide application. Fuzzy multigraph and fuzzy planar graphs are two subclasses of fuzzy graph theory. In this paper, we define both of these graphs and studi...
详细信息
In this paper, a new concept of bifuzzy bi-matrix game is introduced where all elements of the payoff matrices are characterized by bifuzzy variables. The uncertainties of entries of payoff matrices (bifuzzy variables...
In this paper, a new concept of bifuzzy bi-matrix game is introduced where all elements of the payoff matrices are characterized by bifuzzy variables. The uncertainties of entries of payoff matrices (bifuzzy variables) are measured by bifuzzy measure known as Chance measure. Combining the bifuzzy set theory and bi-matrix game theory, the solution concept of bifuzzy bi-matrix game theory is introduced. The quadratic programming problem plays the major role to solve bifuzzy bi-matrix game. In order to show the applicability and feasibility of our proposed method, a real-life bi-matrix game problem is considered and solved.
暂无评论