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.

Sharief Basha S

Department of Mathematics

School of Advanced Sciences

Vellore Campus

Kartheek E.

Fulltext

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

Indian Journal of Science and Technology

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.

International Journal of Engineering & Technology

Dominating Energy of Operations on Intuitionistic Fuzzy Graphs

Objectives: This paper aims at clustering documents using a new similarity measure based on energy of a bipartite graph. Methods/Statistical Analysis: We have made use of bipartite representation of documents and clustered them. The proposed algorithm has been illustrated for a small document set. The documents have been clustered using the new similarity measure based on energy of a bipartite graph introduced by us. Findings: Our proposed algorithm gives a better clustering quality comparing with the k means clustering algorithm. Application/Improvements: This proposed algorithm can be further extended and applied to cluster large document sets.

Journal	Indian Journal of Science and Technology
Publisher	Indian Society for Education and Environment
ISSN	0974-6846
Open Access	No