Vulnerability Parameters in Neutrosophic Graphs
| Main Authors: | R.V. Jaikumar, R. Sundareswaran, G. Balaraman, P K Kishore Kumar, Said Broumi |
|---|---|
| Format: | Article Journal |
| Terbitan: |
, 2022
|
| Subjects: | |
| Online Access: |
https://zenodo.org/record/6041365 |
Daftar Isi:
- Let G = (U, V) be a Single valued Neutrosophic graph. A subset S ∈ U(G) is a said to be score equitable set if the score value of any two nodes in S differ by at most one. That is, |s(u)– s(v)| ≤ 1, u, v ∊ S. If e is an edge with end vertices u and v and score of u is greater than or equal to score of v then we say u strongly dominates v. If every vertex of V − S is strongly influenced by some vertex of S then S is called strong score set of G. The minimum cardinality of a strong dominating set is called the strong score number of G. The equitable integrity of Single valued Neutrosophic graph G which is defined as EI(G) = min{|S| + m(G − S ): S is a score equitable set in G}, where m(G − S) denotes the order of the largest component in G − S. The strong integrity of Single valued Neutrosophic graph G which is defined as SI(G) = min{|S| + m(G −S ): S is a strong score set in G}. In this paper, we study the concepts of equitable integrity and strong equitable integrity in different classes of regular Neutrosophic graphs and discussed the upper and lower bounds