Hypergraphs are among the most ubiquitous models of both natural and human-made structures. They can be used to model system architectures and data structures, and to represent a partition, covering and clustering in the area of circuit design. In this paper, we introduce the notions of vague hypergraphs and dual vague hypergraphs and present some of their interesting properties. We also introduce the notion of A-tempered vague hypergraphs and investigate some of their properties.

In this paper, we propose a new intuitionistic entropy measurement for multi-criteria decision-making (MCDM) problems. The entropy of an intuitionistic fuzzy set (IFS) measures uncertainty related to the data modelling as IFS. The entropy of fuzzy sets is widely used in decision support methods, where dealing with uncertain data grows in importance. The Complex Proportional Assessment (COPRAS) method identifies the preferences and ranking of decisional variants. It also allows for a more comprehensive analysis of complex decision-making problems, where many opposite criteria are observed. This approach allows us to minimize cost and maximize profit in the finally chosen decision (alternative). This paper presents a new entropy measurement for fuzzy intuitionistic sets and an application example using the IFS COPRAS method. The new entropy method was used in the decision-making process to calculate the objective weights. In addition, other entropy methods determining objective weights were also compared with the proposed approach. The presented results allow us to conclude that the new entropy measure can be applied to decision problems in uncertain data environments since the proposed entropy measure is stable and unambiguous.

Fuzzy graphs (FGs) and their generalizations have played an essential role in dealing with real-life problems involving uncertainties. The goal of this article is to show some serious flaws in the existing definitions of several root-level generalized FG structures with the help of some counterexamples. To achieve this, first, we aim to improve the existing definition for interval-valued FG, interval-valued intuitionistic FG and their complements, as these existing definitions are not well-defined; i.e., one can obtain some senseless intervals using the existing definitions. The limitations of the existing definitions and the validity of the new definitions are supported with some examples. It is also observed that the notion of a single-valued neutrosophic graph (SVNG) is not well-defined either. The consequences of the existing definition of SVNG are discussed with the help of examples. A new definition of SVNG is developed, and its improvement is demonstrated with some examples. The definition of an interval-valued neutrosophic graph is also modified due to the shortcomings in the current definition, and the validity of the new definition is proved. An application of proposed work is illustrated through a decision-making problem under the framework of SVNG, and its performance is compared with existing work.