Introduction Totally and Partial Connectivity Indices in Neutrosophic graphs with Application in Behavioral Sciences

Abstract

Connectivity is one of the most important concepts in graph theory. Since Neutrosophic Graphs
are a branch of graphs, connectivity will be very important in this branch as well. In this paper, we will
define the connectivity in Neutrosophic graphs using the strength of connectedness between each pair of
its vertices. Also in this article, we define two new concepts of Partial connectivity index and totally
connectivity index. We present several theorems related to these concepts and prove the theorems.