Mathematical modeling and topological graph description of dominating David derived networks based on edge partitions.

Chemical graph theory is a well-established discipline within chemistry that employs discrete mathematics to represent the physical and biological characteristics of chemical substances. In the realm of chemical compounds, graph theory-based topological indices are commonly employed to depict their geometric structure. The main aim of this paper is to investigate the degree-based topological indices of dominating David derived networks (DDDN) and assess their effectiveness. DDDNs are widely used in analyzing the structural and functional characteristics of complex networks in various fields such as biology, social sciences, and computer science. We considered the FN*, [Formula: see text], and [Formula: see text] topological indices for DDDNs. Our computations' findings provide a clear understanding of the topology of networks that have received limited study. These computed indices exhibit a high level of accuracy when applied to the investigation of QSPRs and QSARs, as they demonstrate the strongest correlation with the acentric factor and entropy.

Social network analysis by Turiyam graphs.

OBJECTIVE: A single valued neutrosophic set represented the uncertainty of real life situations in terms of membership [Formula: see text], indeterminacy [Formula: see text] and non-membership [Formula: see text] degree. However, this uncertainty cannot be limited to those three degrees; there is also an additional refusal degree. For this issue, the Turiyam set is an appropriate tool, which described the neutrosophic refusal degree of this situation as a liberal [Formula: see text] degree in addition to those three degrees. The graphical representation of this situation is required for knowledge processing. For this purpose, the Turiyam graph was introduced as an extension of the single valued neutrosophic graph. This graph is helpful when the depictions of the vertices or their relationships or both, are considered in terms of membership [Formula: see text], indeterminacy [Formula: see text], non-membership [Formula: see text] and liberal [Formula: see text] degrees. The goal of this paper is to introduce the degree, order and size in the context of Turiyam graphs and examine a social network (SN) with the help of this graph. RESULTS: In this regard, the degree, order and size in the context of Turiyam graphs are studied. The feasibility of this Turiyam graph is shown by employing its concept in a social network (SN). Finally, the advantage of the Turiyam graph over the existing graph theories is recognized by viewing its better framework.

Interval-valued bipolar fuzzy line graphs.

OBJECTIVES: The notion of Bipolarity based on positive and negative outcomes. It is well known that bipolar models give more precision, flexibility, and compatibility to the system as compared to the classical models and fuzzy models. A bipolar fuzzy graph(BFG) provides more flexibility while modeling human thinking as compared with a fuzzy graph, and an interval valued bipolar fuzzy graph(IVBFG) has numerous applications where the real-life problem are time dependent and there is a network structure complexity. The aim of this paper is to introduce an interval-valued bipolar line fuzzy graph(IVBFLG). RESULT: In this paper, we have proposed the notion of an IVBFLG and some of its characterizations. Also, some propositions and theorems related to an IVIFLGs are developed and proved. Furthermore, isomorphism between two IVIFLGs toward their IVIFGs was determined and verified. As a result, we derive a necessary and sufficient condition for an IVBFG to be isomorphic to its corresponding IVBFLG and some remarkable properties like degree, size, order, regularity, strength, and completeness of an IVBFLGs have been investigated, and the proposed concepts are illustrated with the examples.

Relations in the context of Turiyam sets.

OBJECTIVE: Recently, the Turiyam set was introduced as an extension of the neutrosophic set to handle the uncertainty data set beyond its truth, indeterminacy and falsity values. This article introduced the Cartesian product of Turiyam sets and Turiyam relations. Further, we defined operations on Turiyam relations as well as discussed the inverse and types of Turiyam relations. RESULTS: The Cartesian product of Turiyam sets, Turiyam relations, inverse Turiyam relation and types of Turiyam relations are stated and their properties are derived. Furthermore, examples are given to clarify some concepts.

Application of maple on computing strong fuzzy chromatic polynomial of fuzzy graphs.

OBJECTIVE: In the field of graph theory, maple is a technical computation form that is used for solving problems. In this article, we apply maple to find the strong fuzzy chromatic polynomial of fuzzy graphs and related. Moreover, we apply maple to obtain strong fuzzy chromatic numbers of fuzzy graphs using their strong fuzzy chromatic polynomials. RESULTS: The strong fuzzy chromatic polynomials for fuzzy graphs, strong fuzzy graphs and complete fuzzy graphs are determined using maple. Furthermore, the strong fuzzy chromatic numbers for the fuzzy graphs are obtained.

Interval Valued Intuitionistic Fuzzy Line Graphs.

OBJECTIVES: In the field of graph theory, an intuitionistic fuzzy set becomes a useful tool to handle problems related to uncertainty and impreciseness. We introduced the interval-valued intuitionistic fuzzy line graphs (IVIFLG) and explored the results related to IVIFLG. RESULT: Some propositions and theorems related to IVIFLG are proposed and proved, which are originated from intuitionistic fuzzy graphs (IVIG). Furthermore, Isomorphism between two IVIFLGs toward their IVIFGs was determined and verified.