Perfect Locating of All Vertices in Some Classes of Neutrosophic Graphs

New setting is introduced to study total-resolving number and neutrosophic total-resolving number arising from total-resolved vertices in neutrosophic graphs assigned to neutrosophic graphs. Minimum number of total-resolved vertices, is a number which is representative based on those vertices. Minimum neutrosophic number of total-resolved vertices corresponded to total-resolving set is called neutrosophic total-resolving number. Forming sets from total-resolved vertices to figure out different types of number of vertices in the sets from total-resolved sets in the terms of minimum number of vertices to get minimum number to assign to neutrosophic graphs is key type of approach to have these notions namely total-resolving number and neutrosophic total-resolving number arising from total-resolved vertices in neutrosophic graphs assigned to neutrosophic graphs. Two numbers and one set are assigned to a neutrosophic graph, are obtained but now both settings lead to approach is on demand which is to compute and to find representatives of sets having smallest number of total-resolved vertices from different types of sets in the terms of minimum number and minimum neutrosophic number forming it to get minimum number to assign to a neutrosophic graph. Let NTG : (V,E,σ,μ) be a neutrosophic graph. Then for given vertices n and n′ if d(s, n) ̸= d(s, n′ ), then s total-resolves n and n′ where d is minimum number of edges amid two vertices, d ≥ 1 and all vertices have to be total-resolved otherwise it will be mentioned which is about d ≥ 0 in some cases but all vertices have to be total-resolved forever. Let S be a set of neutrosophic vertices [a vertex alongside triple pair of its values is called neutrosophic vertex.]. If for every neutrosophic vertices n and n′ in V, there’s at least a neutrosophic vertex s in S such that s total-resolves n and n′, then the set of neutrosophic vertices, S is called total-resolving set. The minimum cardinality between all total-resolving sets is called total-resolving number and it’s denoted by T (N T G); for given vertices n and n′ if d(s, n) ̸= d(s, n′ ), then s total-resolves n and n′ where d is minimum number of edges amid two vertices, d ≥ 1 and all vertices have to be total-resolved otherwise it will be mentioned which is about d ≥ 0 in some cases but all vertices have to be total-resolved forever. Let S be a set of neutrosophic vertices [a vertex alongside triple pair of its values is called neutrosophic vertex.]. If for every neutrosophic vertices n and n′ in V, there’s at least a neutrosophic vertex s in S such that s total-resolves n and n′, then the set of neutrosophic vertices, S is called total-resolving set. The minimum neutrosophic cardinality between all total-resolving sets is called neutrosophic total-resolving number and it’s denoted by Tn(NTG). As concluding results, there are some statements, remarks, examples and

1/56

clarifications about some classes of neutrosophic graphs namely path-neutrosophic graphs, cycle-neutrosophic graphs, complete-neutrosophic graphs, star-neutrosophic graphs, complete-bipartite-neutrosophic graphs, complete-t-partite-neutrosophic graphs, and wheel-neutrosophic graphs. The clarifications are also presented in both sections

“Setting of total-resolving number,” and “Setting of neutrosophic total-resolving number,” for introduced results and used classes. This approach facilitates identifying sets which form total-resolving number and neutrosophic total-resolving number arising from total-resolved vertices in neutrosophic graphs assigned to neutrosophic graphs. In both settings, some classes of well-known neutrosophic graphs are studied. Some clarifications for each result and each definition are provided. The cardinality of set of total-resolved vertices and neutrosophic cardinality of set of total-resolved vertices corresponded to total-resolving set have eligibility to define total-resolving number and neutrosophic total-resolving number but different types of set of total-resolved vertices to define total-resolving sets. Some results get more frameworks and more perspectives about these definitions. The way in that, different types of set of total-resolved vertices in the terms of minimum number to assign to neutrosophic graphs, opens the way to do some approaches. These notions are applied into neutrosophic graphs as individuals but not family of them as drawbacks for these notions. Finding special neutrosophic graphs which are well-known, is an open way to pursue this study. Neutrosophic total-resolving notion is applied to different settings and classes of neutrosophic graphs. Some problems are proposed to pursue this study. Basic familiarities with graph theory and neutrosophic graph theory are proposed for this article.