Novel applications of bipolar single-valued neutrosophic competition graphs

Bipolar single-valued neutrosophic models are the generalization of bipolar fuzzy models. We first introduce the concept of bipolar single-valued neutrosophic competition graphs. We then, discuss some important propositions related to bipolar single-valued neutrosophic competition graphs. We define bipolar single-valued neutrosophic economic competition graphs and m-step bipolar single-valued neutrosophic economic competition graphs. Further, we describe applications of bipolar single-valued neutrosophic competition graphs in organizational designations and brands competition. Finally, we present our improved methods by algorithms.     

A Survey on Single-Valued Neutrosophic $K$-Algebras

In this survey, we first present a brief overview of logical algebras. We then discuss concepts of single-valued neutrosophic $K$-subalgebras, single-valued neutrosophic soft $K$-algebras and single-valued neutrosophic topological $K$-algebras. Moreover, we discuss various fundamental concepts which include interior, closure, $C{_5}$-connectivity, super connectivity, compactness and Hausdorffness of single-valued neutrosophic topological $K$-algebras.     

Group decision making with simplified neutrosophic ordered weighted distance operator

Simplified neutrosophic set is a convenient tool proposed for dealing with complex problems; it is effective in providing more data for decision‐making process. In this study, we develop a simplified neutrosophic ordered weighted distance operator which combines the neutrosophic distance measures and the ordered weighted average distance in the same formulation. It is a new handy aggregation operator that considers the situations where the input data are represented in simplified neutrosophic numbers, and it also contains diverse distance aggregation operators. Parameterized families of simplified neutrosophic ordered weighted distance operator are handled. Moreover, we establish a new neutrosophic group decision‐making method based on the simplified neutrosophic ordered weighted distance operator, which has 2 extended approaches for determining the weights of decision makers and decision attributes in decision‐making process, respectively. Finally, an illustrative example demonstrates the application of the proposed method. The effectiveness and advantages of the proposed method are shown by the comparative analysis with existing relative methods.     

Single valued neutrosophic cross-entropy for multicriteria decision making problems

A single valued neutrosophic set (SVNS) is an instance of a neutrosophic set, which give us an additional possibility to represent uncertainty, imprecise, incomplete, and inconsistent information which exist in real world. It would be more suitable to apply indeterminate information and inconsistent information measures. In this paper, the cross entropy of SVNSs, called single valued neutrosophic cross entropy, is proposed as an extension of the cross entropy of fuzzy sets. Then, a multicriteria decision-making method based on the proposed single valued neutrosophic cross entropy is established in which criteria values for alternatives are SVNSs. In decision making process, we utilize the single-valued neutrosophic weighted cross entropy between the ideal alternative and an alternative to rank the alternatives corresponding to the cross entropy values and to select the most desirable one(s). Finally, a practical example of the choosing problem of suppliers is provided to illustrate the application of the developed approach.     

基于单值中智集Choquet积分算子的群决策方法

单值中智集不仅能描述现实决策系统中不完整信息而且能描述不确定性和不一致信息,已有关于单值中智集的决策方法只能用来解决属性间相互独立的多属性决策问题.考虑到Choquet积分算子的特点,将Choquet积分算子应用到单值中智集中,用以解决属性间有关联关系的多属性群决策问题.首先应用单值中智集余弦相似度比较方法,提出了单值中智集Choquet积分算子,研究了其性质.然后建立了基于单值中智集Choquet积分算子的多属性群决策方法.最后通过实例分析说明了算法的可行性和有效性.     

Accessible single-valued neutrosophic graphs

This paper derived single-valued neutrosophic graphs from single-valued neutrosophic hypergraphs via strong equivalence relation. We show that any weak single-valued neutrosophic graph is a derived single-valued neutrosophic graph and any linear weak single-valued neutrosophic tree is an extendable linear single-valued neutrosophic tree.     

New concepts in neutrosophic graphs with application

A neutrosophic set is a generalization of an intuitionistic fuzzy set. Neutrosophic models give more flexibility, precisions and compatibility to the system as compared to intuitionistic fuzzy models. In this research study, we apply the concept of neutrosophic sets to graphs and discuss certain concepts of single-valued neutrosophic graphs. We illustrate the concepts by several examples. We investigate some interesting properties. We describe an application of single-valued neutrosophic graph in decision making process. We also present the procedure of our proposed method as an algorithm.     

基于在线评价且考虑消费者类型的酒店排序方法

针对在线评价的发布时间、获得的“有用”的投票数以及是否被贴上“砖家”点评标签对在线评价信息可信度和消费者购买决策具有重要影响,提出一种基于在线评价信息且考虑评价信息可信度及消费者类型的酒店排序方法。首先,将不同类型消费者群体给出的在线评价信息转换成考虑在线评价信息可信度的区间中智数;其次,依据区间中智数距离测度公式确定针对目标群体的各消费者群体权重,进而依据INLNPA集成算子集结各消费者群体评价信息确定针对目标群体的酒店-属性决策矩阵;再次,依据区间中智集熵测度方法确定各属性权重,在此基础上,基于VIKOR方法得到针对目标群体的酒店排序结果;最后,通过一个实例分析说明该方法的有效性和可行性。     

Single-Valued Neutrosophic Lie Algebras

A single-valued neutrosophic (SVN) set is a powerful general formal framework that generalizes the concept of fuzzy set and intuitionistic fuzzy set. In SVN set, indeterminacy is quantified explicitly, and truth membership, indeterminacy membership, and falsity membership are independent. In this paper, we apply the notion of SVN sets to Lie algebras. We develop the concepts of SVN Lie subalgebras and SVN Lie ideals. We describe some interesting results of SVN Lie ideals.     

基于QUALIFLEX和LINMAP的简化中性犹豫模糊多属性决策方法

在处理多属性决策问题中,QUALIFLEX是一种非常有用的排序算法。针对属性取值为简化中性犹豫模糊集的多属性决策问题,提出了SNHFS-QUALIFLEX算法。另外考虑到属性权重不确定的情况,将LINMAP扩展到简化中性犹豫模糊集中,定义了符号距离,建立了最优数学规划模型来确定属性权重。最后将SNHFS-QUALIFLEX方法应用到多属性决策实例中,并验证了其可行性和有效性。     

Forbidden induced subgraph characterizations of subclasses and variations of perfect graphs: A survey

A graph is perfect if the chromatic number is equal to the clique number for every induced subgraph of the graph. Perfect graphs were defined by Berge in the sixties. In this survey we present known results about partial characterizations by forbidden induced subgraphs of different graph classes related to perfect graphs. We analyze a variation of perfect graphs, clique-perfect graphs, and two subclasses of perfect graphs, coordinated graphs and balanced graphs.     

On the Zagreb indices of the line graphs of the subdivision graphs

The aim of this paper is to investigate the Zagreb indices of the line graphs of the tadpole graphs, wheel graphs and ladder graphs using the subdivision concepts.     

On minimal forbidden subgraph characterizations of balanced graphs

A graph is balanced if its clique-matrix contains no edge–vertex incidence matrix of an odd chordless cycle as a submatrix. While a forbidden induced subgraph characterization of balanced graphs is known, there is no such characterization by minimal forbidden induced subgraphs. In this work, we provide minimal forbidden induced subgraph characterizations of balanced graphs restricted to graphs that belong to one of the following graph classes: complements of bipartite graphs, line graphs of multigraphs, and complements of line graphs of multigraphs. These characterizations lead to linear-time recognition algorithms for balanced graphs within the same three graph classes.     

Characterizations and recognition of circular-arc graphs and subclasses: A survey

Circular graphs are intersection graphs of arcs on a circle. These graphs are reported to have been studied since 1964, and they have been receiving considerable attention since a series of papers by Tucker in the 1970s. Various subclasses of circular-arc graphs have also been studied. Among these are the proper circular-arc graphs, unit circular-arc graphs, Helly circular-arc graphs and co-bipartite circular-arc graphs. Several characterizations and recognition algorithms have been formulated for circular-arc graphs and its subclasses. In particular, it should be mentioned that linear time algorithms are known for all these classes of graphs. In the present paper, we survey these characterizations and recognition algorithms, with emphasis on the linear time algorithms.     

Characterizing distance-regularity of graphs by the spectrum

We characterize the distance-regular Ivanov-Ivanov-Faradjev graph from the spectrum, and construct cospectral graphs of the Johnson graphs, Doubled Odd graphs, Grassmann graphs, Doubled Grassmann graphs, antipodal covers of complete bipartite graphs, and many of the Taylor graphs. We survey the known results on cospectral graphs of the Hamming graphs, and of all distance-regular graphs on at most 70 vertices.     

Marginal AMP chain graphs

We present a new family of models that is based on graphs that may have undirected, directed and bidirected edges. We name these new models marginal AMP (MAMP) chain graphs because each of them is Markov equivalent to some AMP chain graph under marginalization of some of its nodes. However, MAMP chain graphs do not only subsume AMP chain graphs but also multivariate regression chain graphs. We describe global and pairwise Markov properties for MAMP chain graphs and prove their equivalence for compositional graphoids. We also characterize when two MAMP chain graphs are Markov equivalent.For Gaussian probability distributions, we also show that every MAMP chain graph is Markov equivalent to some directed and acyclic graph with deterministic nodes under marginalization and conditioning on some of its nodes. This is important because it implies that the independence model represented by a MAMP chain graph can be accounted for by some data generating process that is partially observed and has selection bias. Finally, we modify MAMP chain graphs so that they are closed under marginalization for Gaussian probability distributions. This is a desirable feature because it guarantees parsimonious models under marginalization.     

Transitive,Locally Finite Median Graphs with Finite Blocks

The subject of this paper are infinite, locally finite, vertex-transitive median graphs. It is shown that the finiteness of the Θ-classes of such graphs does not guarantee finite blocks. Blocks become finite if, in addition, no finite sequence of Θ-contractions produces new cut-vertices. It is proved that there are only finitely many vertex-transitive median graphs of given finite degree with finite blocks. An infinite family of vertex-transitive median graphs with finite intransitive blocks is also constructed and the list of vertex-transitive median graphs of degree four is presented. Sandi Klavžar: Supported by the Ministry of Science of Slovenia under the grant P1-0297. The author is also with the Faculty of Mathematics and Natural Sciences, University of Maribor, Slovenia and the Institute of Mathematics, Physics and Mechanics, Ljubljana.     

On conservative and supermagic graphs

A graph is called supermagic if it admits a labelling of the edges by pairwise different consecutive positive integers such that the sum of the labels of the edges incident with a vertex is independent of the particular vertex. A graph G is called conservative if it admits an orientation and a labelling of the edges by integers {1,…,|E(G)|} such that at each vertex the sum of the labels on the incoming edges is equal to the sum of the labels on the outgoing edges. In this paper we deal with conservative graphs and their connection with the supermagic graphs. We introduce a new method to construct supermagic graphs using conservative graphs. Inter alia we show that the union of some circulant graphs and regular complete multipartite graphs are supermagic.     

Chordal bipartite, strongly chordal, and strongly chordal bipartite graphs

Robert E. Jamison characterized chordal graphs by the edge set of every k-cycle being the symmetric difference of k−2 triangles. Strongly chordal (and chordal bipartite) graphs can be similarly characterized in terms of the distribution of triangles (respectively, quadrilaterals). These results motivate a definition of ‘strongly chordal bipartite graphs’, forming a class intermediate between bipartite interval graphs and chordal bipartite graphs.     

Two-ended regular median graphs

We show that regular median graphs of linear growth are the Cartesian product of finite hypercubes with the two-way infinite path. Such graphs are Cayley graphs and have only two ends.For cubic median graphs G the condition of linear growth can be weakened to the condition that G has two ends. For higher degree the relaxation to two-ended graphs is not possible, which we demonstrate by an example of a median graph of degree four that has two ends, but nonlinear growth.