Various Degrees of Directed Single Valued Neutrosophic Graphs

Authors

  • V. Visalakshi Department of Mathematics, College of Engineering and Technology, SRM Institute of Science and Technology, Kattankulathur, Tamil Nadu, India
  • D. Keerthana Department of Mathematics, College of Engineering and Technology, SRM Institute of Science and Technology, Kattankulathur, Tamil Nadu, India
  • C. Rajapandiyan Department of Mathematics, College of Engineering and Technology, SRM Institute of Science and Technology, Kattankulathur, Tamil Nadu, India
  • Saeid Jafari Mathematical and Physical Science Foundation, Sidevej 5, 4200 Slagelse, Denmark

Keywords:

Neutrosophic graphs, Directed fuzzy graphs, Indegree, Outdegree, Effective edges

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.

Downloads

Download data is not yet available.

Downloads

Published

2024-09-10

How to Cite

V. Visalakshi, D. Keerthana, C. Rajapandiyan, & Saeid Jafari. (2024). Various Degrees of Directed Single Valued Neutrosophic Graphs. Neutrosophic Sets and Systems, 73, 526-537. https://fs.unm.edu/nss8/index.php/111/article/view/5070