Vellore Institute of Technology (VIT) is a private university located in&nbsp;Tamil Nadu, India. Founded in 1984, as Vellore Engineering College, the institution offers 20 undergraduate, 34 postgraduate, four integrated and four research programs. It has campuses in Vellore, Amravati, Bhopal and Chennai.

VIT is one of the top ranked private universities in India according to NIRF, THE and QS Rankings.&nbsp;Govt. of India has recognized&nbsp;VIT, Vellore as an&nbsp;Institution of Eminence. This has allowed VIT to take independent quality initiatives and move up in world ranking.

&nbsp;

&nbsp;

VIT University

In this paper, MATLAB software for computing signless laplacian energy of an intuitionistic fuzzy matrix, weight characteristic of signless laplacian energies of an intuitionistic fuzzy graphs, the intuitionistic fluffy weighted averag-ing(IFWA) by the utilization of TOPSIS method are created. This has been detailed the utilization of the hypothetical perspectives that are demonstrated in [6]. These packages are demonstrated with appropriate illustrations. We installed the MAT-LAB programme for choosing the simplest alliance partner selection of automobile company. © 2020, Research Publication. All rights reserved.

World University root node

Department of Mathematics

School of Advanced Sciences

Vellore Campus

Advances in Mathematics: Scientific Journal

Group decision making of selecting partner based on signless laplacian energy of an intuitionistic fuzzy graph with topsis method: Study on matlab programming

Group decision-making shows an significant role when allocating with decision making problems with the fast growth of society. The foremost determination of this paper is to show the reasonableness of some group decision making on the laplacian energy of an intuitionistic fuzzy graphs. we present numerical examples, including Alliance partner selection of a software company, Partner selection in supply chain management and the estimation of the outlines of reservoir action to illuminate the presentations of our planned concepts in result making to rank the best one.. © 2020 IJSTR.

International Journal of Scientific and Technology Research

Group decision making based on laplacian energy of an intuitionistic fuzzy graph

In this paper investigate the critical set of reverse edge magic labeling on caterpillar graphs and application on secret sharing scheme. Here we construct a distribution scheme based on super visional secret sharing scheme. The schemes use the notion of critical sets to distribute the share and reconstruct the key. IJSTR©2019.

Critical set of caterpillar graph for secret sharing scheme based on reverse super edge magic labeling

We investigate the critical sets of reverse edge-magic labelings on graphs, especially star, and the application on secret sharing In this paper, we propose two-level secret sharing scheme based critical sets on a reverse edge magic labeling of star graphs. It is a scheme which creates two types of hierarchical sets. The first set contains share that are more powerful than the share in the second set. We name this scheme the departmental secret sharing scheme. These two secret sharing schemes are constructed by critical sets of reverse edge-magic labelling. We build banking secret sharing scheme that will share a secret among one bank manager and several sets of authorized staff members. © 2019 Author(s).

RECENT TRENDS IN PURE AND APPLIED MATHEMATICS

Two-level secret sharing schemes based on critical sets of reverse edge-magic labelings

Graph labeling is a currently emerging area in the research of graph theory. A graph labeling is an assignment of integers to the vertices or edges or both subject to certain conditions. If the labels of edges are distinct positive integers and for each vertex the sum of the labels of all edges incident with is the same for every vertex in the given graph, then the labeling of the graph is called magic labeling. There are several types of magic labeling defined on graphs. In this paper we consider vertex magic labeling and group magic labeling of graphs as an application of magic labeling. We solve a problem of finding number of computers/workstations to be allocated to each department in a company under certain conditions.

International Journal of Innovative Technology and Exploring Engineering Regular Issue

Application of Reverse Vertex Magic Labeling of a Graph

The observation of an Intuitionistic Fuzzy Graph’s signless laplacian energy is expanded innumerous products in Intuitionistic Fuzzy Graph. During this paper, we have got the value of signless laplacian Energy in unrelated products such as Cartesian product, Lexicographic Product, Tensor product and Strong Product, product, product and product amongst 2 intuitionistic Fuzzy graphs. Additionally we tend to study the relation between the Signless laplacian Energy within the varied products in 2 Intuitionistic Fuzzy Graphs

VIT Unitversity

International Journal of Recent Technology and Engineering Regular Issue

Signless Laplacian Energy in Products of Intuitionistic Fuzzy Graphs

The concept of Laplacian energy of an intuitionistic fuzzy graph is extended to Laplacian energy in operations on intuitionistic fuzzy graph. In this paper, we have obtained the value of Laplacian energy in different operations such as union and join between two intuitionistic fuzzy graphs. Also we study the relation between the Laplacian energy in the operations on two intuitionistic fuzzy graphs. © Springer Nature Switzerland AG 2019.

Trends in Mathematics

Laplacian energy of operations on intuitionistic fuzzy graphs

The concept of energy of an Intuitionistic Fuzzy Graph is extended to dominating Energy in operations on Intuitionistic Fuzzy Graph. In this paper, We have obtained the value of dominating Energy in different operations such as complement, Union, Join, Cartesian product and composition between two intuitionistic Fuzzy graphs. Also we study the relation between the dominating Energy in the operations on two Intuitionistic Fuzzy Graphs.

Department of Chemistry

Fulltext

International Journal of Engineering & Technology

Dominating Energy of Operations on Intuitionistic Fuzzy Graphs

In this paper, we investigate the adjacency matrix of reverse super edge magic vertex graph and use this graph to construct other reverse super edge magic graphs with the same edge weight set. Additionally, by combining known reverse super edge magic labelled graphs, we give a construction for a new reverse super edge magic graph

Construction of Reverse Super Edge Magic Total Graphs

The transportation problem is the classical combinatorial optimization problem arising in numerous planning and designing contexts. In this paper, a recurrent neural network for solving the transportation problem is presented. The recurrent neural network is able to generate optimal solutions to the transportation problem. The performance of the recurrent neural network is demonstrated by means of an illustrative example. The recurrent neural network is shown to be capable of generating the transportation and suitable for electronic implementation. © RJPT All right reserved.

Research Journal of Pharmacy and Technology

Solving transportation problem using recurrent neural network

In this paper, we introduce the Max-Min intuitionistic laplacian fuzzy matrix ML(G) of an intuitionistic fuzzy graph. Also defined the extreme laplacian energy of ML(G). We also give the explicit expression for the coefficients of the characteristic polynomial of ML(G). These concepts are illustrated with real time examples. © 2016, International Journal of Pharmacy and Technology. All rights reserved.

International Journal of Pure and Apllied Mathematics

MAX-MIN INTUITIONISTIC FUZZY MATRIX OF AN INTUITIONISTIC FUZZY GRAPH

Background/Objectives: The concept of Laplacian energy of fuzzy graph is extended to the Laplacian energy of an intuitionistic fuzzy graph. Methods/Statistical Analysis: In this paper, we defined the adjacency matrix of an intuitionistic fuzzy graph and the Laplacian energy of an intuitionistic fuzzy graph is defined in terms of its adjacency matrix. Findings: The lower and upper bound for the energy of an intuitionistic fuzzy graph are also derived and verified with suitable intuitionistic fuzzy graphs. Application/Improvements: Laplacian spectra of intutionistic fuzzy graphs may reveal more analogous results in the chemical molecules.