The study of graphs containing edges and nodes is of great importance in science and in real life. Topological indices are numerical parameters linked to chemical graphs used to estimate the biological, toxicological, and physical properties of chemical compounds. Recently, two terms, ev-degree- and ve-degree-based TIs, have been defined in chemical graph theory. In this paper, we have estimated degree-based TIs, namely, ev-degree Zagreb type index, ev-degree Randic index, ve-degree atom-bond connectivity index, ve-degree geometric arithmetic index , ve-degree harmonic index, and ve-degree sum-connectivity index for - .
Source localization is one of the most challenging problems in complex networks. Monitoring and controlling complex networks is of great interest for understanding different types of systems, such as biological, technological, and complex physical systems. Modern research has made great developments in identifying sensors through which we can monitor or control complex systems. For this task, we choose a set of sensors with the smallest possible size so that the source may be identified. The problem of locating the source of an epidemic in a network is equivalent to the problem of finding the minimal doubly resolving sets (MDRSs) in a network. In this paper, we calculate the minimal doubly resolving sets (MDRSs) of some classes of convex polytopes in order to compute their double metric dimension (DMD).
A measurement of the molecular topology of graphs is known as a topological index, and several physical and chemical properties such as heat formation, boiling point, vaporization, enthalpy, and entropy are used to characterize them. Graph theory is useful in evaluating the relationship between various topological indices of some graphs derived by applying certain graph operations. Graph operations play an important role in many applications of graph theory because many big graphs can be obtained from small graphs. Here, we discuss two graph operations, i.e., double graph and strong double graph. In this article, we will compute the topological indices such as geometric arithmetic index , atom bond connectivity index , forgotten index , inverse sum indeg index , general inverse sum indeg index , first multiplicative-Zagreb index and second multiplicative-Zagreb index , fifth geometric arithmetic index , fourth atom bond connectivity index of double graph, and strong double graph of Dutch Windmill graph .
The concept of resolving sets (RSs) and metric dimension (MD) invariants have a wide range of applications in robot navigation, computer networks, and chemical structure. RS has been used as a sensor in an indoor positioning system to find an interrupter. Many terminologies in machine learning have also been used to diagnose the interrupter in the systems of marine and gas turbines using sensory data. We proposed a fault‐tolerant self‐stable system that allows for the detection of an interrupter even if one of the sensors in the chain fails. If the elimination of any element from a RS is still a RS, then the RS is considered as a fault‐tolerant resolving set (FTRS), and the fault‐tolerant metric dimension (FTMD) is its minimum cardinality. In this paper, we calculated the FTMD of the subdivision graphs of the necklace and prism graphs. We also found that this invariant has constant values for both graphs.
The most productive application of graph theory in chemistry is the representation of molecules by the graphs, where vertices and edges of graphs are the atoms and valence bonds between a pair of atoms, respectively. For a vertex and an edge of a connected graph , the minimum number from distances of with and is called the distance between and . If for every two distinct edges , there always exists such that , then is named as an edge metric generator. The minimum number of vertices in is known as the edge metric dimension of . In this paper, we calculate the edge metric dimension of ortho-polyphenyl chain graph , meta-polyphenyl chain graph , and the linear [n]-tetracene graph and also find the edge metric dimension of para-polyphenyl chain graph . It has been proved that the edge metric dimension of , , and is bounded, while
As a valuable tool for representing uncertain information, probabilistic hesitant fuzzy sets (PHFS) have gained considerable recognition and in‐depth discussion in recent years to increase the flexibility and manifest hesitant information in decision‐making problems. However, decision‐makers (DMs) cannot express all preferences only through a few probabilistic terms in actual decision‐making. Much critical information is hidden behind the original information provided by the DMs. Keeping that in mind, we are interested in mining deeper uncertain information from the original probabilistic hesitant fuzzy evaluation data. To achieve the target, we put forward a novel representation tool called the normal wiggly probabilistic hesitant fuzzy set (NWPHFS) to extract deeper uncertain preferences from original probabilistic information. NWPHFS retains the original evaluation information and carries and assesses the potential uncertain details for increasing the rationality of decision‐making outcomes. Herein, we propose some fundamental concepts of NWPHFS, for instance, some elementary operational laws, distance measures between two NWPHFSs, and score function. We also suggest two new aggregation operators, that is, the normal wiggly probabilistic hesitant fuzzy weighted averaging (NWPHFWA) and normal wiggly probabilistic hesitant fuzzy weighted geometric (NWPHFWG). A novel mechanism is proposed here to work out multiattribute decision‐making (MADM) in solving normal wiggly probabilistic decision‐making problems. Through a practical example of environmental quality assessment, the specific calculation steps of this method are epitomized. Finally, we have demonstrated the feasibility and advancement of the proposed approach via a comprehensive comparative study.