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.     

通过增强型萨格勒布指数对图排序

Recently, Furtula et al. proposed a valuable predictive index in the study of the heat of formation in octanes and heptanes, the augmented Zagreb index(AZI index) of a graph G, which is defined as AZI(G) =∑uv∈E(G)( d_u d_v/d_u + d_v-2)~3,where E(G) is the edge set of G, d u and d v are the degrees of the terminal vertices u and v of edge uv, respectively. In this paper, we obtain the first five largest(resp., the first two smallest) AZI indices of connected graphs with n vertices. Moreover, we determine the trees of order n with the first three smallest AZI indices, the unicyclic graphs of order n with the minimum, the second minimum AZI indices, and the bicyclic graphs of order n with the minimum AZI index, respectively.     

Genus Distributions for Several Types of Ladder-class Graphs

Calculating the genus distributions of ladder graphs is a concerned topic in topological graph theory.In this paper,we formulate several ladder-class graphs by using a starting graph iterative amalgamation with copies of a path to construct a base graph and then adding some edges to the appointed root-vertices of the base graph.By means of transfer matrix and a finer partition of the embeddings,the explicit formulas for the genus distribution polynomials of four types of ladder-class graphs are derived.     

Compact n-Manifolds via(n+l)-Colored Graphs:a New Approach

We introduce a representation via(n+l)-colored graphs of compact n-manifolds with(possibly empty)boundary,which appears to be very convenient for computer aided study and tabulation.Our construction is a generalization to arbitrary dimension of the one recently given by Cristofori and Mulazzani in dimension three,and it is dual to the one given by Pezzana in the 1970s.In this context we establish some results concerning the topology of the represented manifolds:suspensions,fundamental groups,connected sums and moves between graphs representing the same manifold.Classification results of compact orientable 4-manifolds representable by graphs up to six vertices are obtained,together with some properties of the G-degree of 5-colored graphs relating this approach to tensor models theory.     

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.     

单圈图的零度的一个注记

The number of zero eigenvalues in the spectrum of the graph G is called its nullity and is denoted by η(G).In this paper,we determine the all extremal unicyclic graphs achieving the fifth upper bound n-6 and the sixth upperbound n-7.     

Cycles Containing a Subset of a Given Set of Elements in Cubic Graphs

The technique of contractions and the known results in the study of cycles in $3$-connected cubic graphs are applied to obtain the following result. Let $G$ be a $3$-connected cubic graph, $X\subseteq V(G)$ with $|X| = 16$ and $e\in E(G)$. Then either for every $8$-subset $A$ of $X$, $A\cup\{e\}$ is cyclable or for some $14$-subset $A$ of $X$, $A\cup\{e\}$ is cyclable.     

零维数等于1的单圈图

The nullity of a graph G is defined to be the multiplicity of the eigenvalue zero in its spectrum. In this paper we characterize the unicyclic graphs with nullity one in aspect of its graphical construction.     

Small Directed Strongly Regular Graphs

The goal of the present paper is to provide a gallery of small directed strongly regular graphs.For each graph of order n≤12 and valency k相似文献   

Some results on strongly regular graphs from unions of cyclotomic classes

In this paper, we construct some families of strongly regular graphs on finite fields by using unions of cyclotomic classes and index 2 Gauss sums. New infinite families of strongly regular graphs are found.     

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.     

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方法得到针对目标群体的酒店排序结果;最后,通过一个实例分析说明该方法的有效性和可行性。     

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

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