Various Degrees of Directed Single Valued Neutrosophic Graphs

Authors

V. Visalakshi
D. Keerthana
C. Rajapandiyan
Saeid Jafari

Abstract

This paper introduces the concept of Directed Single Valued Neutrosophic Graphs (DSVNG) and explains how to determine the degree and total degree of vertices, considering both indegree and outdegree, along with the maximum and minimum degrees of a DSVNG. The properties of these aspects are analyzed through examples. Additionally, the paper identifies the effective edges of a DSVNG and explores the effective indegree, effective outdegree of vertices, as well as the effective maximum and minimum degrees in relation to indegree and outdegree with examples.

Recommended Citation

Visalakshi, V.; D. Keerthana; C. Rajapandiyan; and Saeid Jafari. "Various Degrees of Directed Single Valued Neutrosophic Graphs." Neutrosophic Sets and Systems 73, 1 (2024). https://digitalrepository.unm.edu/nss_journal/vol73/iss1/44